Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Results tagged with algebraic-graph-theory
Search options not deleted
user 10881
Algebraic methods in Graph Theory; the linear algebra method, graph homomorphisms, group theoretic methods (for example Cayley graphs), and graph invariants. For graph eigenvalue problems use the spectral-graph-theory tag. For strongly regular graphs use the strongly-regular-graph tag. For Kneser graphs use the kneser-graph tag.
4
votes
How can I prove that a particular family of graphs is integral?
As a service, here is a sage program.
def G(n, k):
"""
Mathoverflow Question 159022
"""
vertices = Words(range(k + 1), n)
vertices = [w for w in vertices if w.count(ZZ(0)) == 1]
…
6
votes
Automorphism group of a special commuting graph
Easy enough
sage: G=SymmetricGroup(6)
sage: cc=G.conjugacy_class([2,2,1,1])
sage: gr=Graph([cc, lambda a,b: a*b==b*a and a!=b])
sage: gr.automorphism_group().cardinality()
1440