Using determining sets to distinguish Kneser graphs.
Albertson, Michael O., Boutin, Debra L. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Identifying graph automorphisms using determining sets.”
Using determining sets to distinguish Kneser graphs.
Fixing numbers of graphs and groups.
Gibbons, Courtney R., Laison, Joshua D. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the maximum automorphism group of self-complementary graphs
Tomasz Łuczak (2000)
Mathematica Slovaca
Similarity:
Symmetry breaking in graphs.
Albertson, Michael O., Collins, Karen L. (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On double covers of graphs
Bohdan Zelinka (1982)
Mathematica Slovaca
Similarity:
On the graphs of Hoffman-Singleton and Higman-Sims.
Hafner, Paul R. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Distinguishing Cartesian powers of graphs.
Albertson, Michael O. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bounds on the distinguishing chromatic number.
Collins, Karen L., Hovey, Mark, Trenk, Ann N. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity: