Problems in algebraic combinatorics.
Godsil, C.D. (1994)
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 “Yet another distance regular graph related to a Golay code.”
Problems in algebraic combinatorics.
Switching of edges in strongly regular graphs. I: A family of partial difference sets on 100 vertices.
Jørgensen, L.K., Klin, M. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Perfect codes in regular graphs
I. Dvořáková-Rulićová (1988)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Dynamic cage survey.
Exoo, Geoffrey, Jajcay, Robert (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The remarkable generalized Petersen graph
Dragan Marušič, Tomaž Pisanski (2000)
Mathematica Slovaca
Similarity:
Explicit Ramsey graphs and Erdős distance problems over finite Euclidean and non-Euclidean spaces.
Le Anh Vinh (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A novel approach for detection and elimination of automorphic graphs in graph databases.
Vijayalakshmi, R., Nadarajan, R., Nirmala, P., Thilaga, M. (2010)
International Journal of Open Problems in Computer Science and Mathematics. IJOPCM
Similarity:
A quasi-spectral characterization of strongly distance-regular graphs.
Fiol, M.A. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity: