On the graphs of Hoffman-Singleton and Higman-Sims.
Hafner, Paul R. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Crooked functions, bent functions, and distance regular graphs.”
On the graphs of Hoffman-Singleton and Higman-Sims.
Identifying graph automorphisms using determining sets.
Boutin, Debra L. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Problems in algebraic combinatorics.
Godsil, C.D. (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A Turán type problem concerning the powers of the degrees of a graph.
Caro, Yair, Yuster, Raphael (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Constructions for cubic graphs with large girth.
Biggs, Norman (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Using determining sets to distinguish Kneser graphs.
Albertson, Michael O., Boutin, Debra L. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
-free graphs of large minimum degree.
Alon, Noga, Sudakov, Benny (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Induced complete -partite graphs in dense clique-less graphs.
Fischer, Eldar (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Distinct distances in graph drawings.
Carmi, Paz, Dujmovic, Vida, Morin, Pat, Wood, David R. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Tight upper bounds for the domination numbers of graphs with given order and minimum degree.
Clark, W.Edwin, Dunning, Larry A. (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Edit distance and its computation.
Balogh, József, Martin, Ryan (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Degree sequences of -free graphs.
Pikhurko, Oleg, Taraz, Anusch (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity: