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 28104
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.
8
votes
Accepted
A question about (unicity of certain cycles in a Cayley graph of a) symmetric group
The smallest $n$ for which there exist sequences as asked for is $n = 7$:
$(1,2,3,4,5,6,7) \cdot (1,2) \cdot (1,7,6,5,4,3,2) \cdot (1,2)
\cdot (1,2,3,4,5,6,7) \cdot (1,2) \cdot$
$(1,7,6,5,4,3, …
- 19.6k