New prolific constructions of strongly regular graphs.
Fon-Der-Flaass, Dmitry G. (2002)
Advances in Geometry
Similarity:
Displaying similar documents to “Embedding arbitrary graphs into strongly regular and distance-regular graphs.”
New prolific constructions of strongly regular graphs.
A prolific construction of strongly regular graphs with the -e. c. property.
Cameron, Peter J., Stark, Dudley (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The strongly regular (40, 12, 2, 4) graphs.
Spence, E. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Problems in algebraic combinatorics.
Godsil, C.D. (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Smallest Regular Graphs of Given Degree and Diameter
Martin Knor (2014)
Discussiones Mathematicae Graph Theory
Similarity:
In this note we present a sharp lower bound on the number of vertices in a regular graph of given degree and diameter.
Graphs with least eigenvalue -2 attaining a convex quadratic upper bound for the stability number
D. M. Cardoso, D. Cvetković (2006)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
Large holes in quasi-random graphs.
Polcyn, Joanna (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dynamic cage survey.
Exoo, Geoffrey, Jajcay, Robert (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Regular spanning subgraphs of bipartite graphs of high minimum degree.
Csaba, Béla (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Extension of strongly regular graphs.
Gera, Ralucca, Shen, Jian (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity: