Search results

| properties = [[Strongly regular graph|Strongly regular]]<br/>[[Symmetric graph]] The '''Suzuki graph''' is a [[strongly regular graph]] with parameters <math>(1782, 416, 100, 96)</math>. Its automorphis ...

| properties = [[Distance regular graph|Distance regular]]<br/>[[Hamiltonian graph|Hamiltonian]] The '''Sylvester graph''' is the unique [[Distance regular graph|distance-regular]] graph ...

| properties = [[Distance regular graph|Distance regular]]<br/>[[Hamiltonian graph|Hamiltonian]] The '''Wells graph''' is the unique [[Distance regular graph|distance-regular]] graph ...

...on <math>\ell</math> but not depend on the choice of vertex. Walk-regular graphs can be thought of as a [[spectral graph theory]] analogue of [[vertex-trans While a walk-regular graph is not necessarily very [[graph automorphism|symmetric]], all its ver ...

{{Short description|Strongly regular graph}} | properties = [[Strongly regular graph|Strongly regular]]<br/>[[Symmetric graph]] ...

...field of [[graph theory]], the '''Meringer graph''' is a 5-[[regular graph|regular]] [[undirected graph]] with 30 vertices and 75 edges named after Markus Mer | title = Fast generation of regular graphs and construction of cages ...

...]] field of [[graph theory]], the '''Foster cage''' is a 5-[[regular graph|regular]] [[undirected graph]] with 30 vertices and 75 edges.<ref>{{MathWorld|urlna | title = Fast generation of regular graphs and construction of cages ...

...l]] field of [[graph theory]], the '''Wong graph''' is a 5-[[regular graph|regular]] [[undirected graph]] with 30 vertices and 75 edges.<ref>{{MathWorld|urlna | title = Fast generation of regular graphs and construction of cages ...

| properties = [[Strongly regular graph|Strongly regular]]<br>[[Hamiltonian graph|Hamiltonian]]<br>[[Triangle-free graph|Triangle-fr ...ef>[http://genealogy.math.ndsu.nodak.edu/id.php?id=35587 Allan Gewirtz], ''Graphs with Maximal Even Girth'', Ph.D. Dissertation in Mathematics, City Universi ...

{{Short description|Cubic distance-regular graph with 102 nodes and 153 edges}} ...rties = [[Symmetric graph|Symmetric]]<br>[[Distance-regular graph|Distance-regular]]<br>[[Cubic graph|Cubic]]<br>[[Hamiltonian graph|Hamiltonian]] ...

{{Short description|5-regular undirected graph with 30 vertices and 75 edges}} ...[[graph theory]], the '''Robertson–Wegner graph''' is a 5-[[regular graph|regular]] [[undirected graph]] with 30 vertices and 75 edges named after [[Neil Rob ...

| contribution = Which graphs have integral spectra? | title = Graphs and Combinatorics: Proceedings of the Capital Conference on Graph Theory an ...

| properties = [[Regular graph|2-regular]]<br>[[Vertex-transitive graph|Vertex-transitive]]<br>[[Edge-transitive gra [[Category:Individual graphs]] ...

...|Perfect]]<br>[[Eulerian graph|Eulerian]]<br>[[1-walk regular graph|1-walk regular]] ...R. and Haemers, W. H. "Spectral Characterizations of Some Distance-Regular Graphs." J. Algebraic Combin. 15, 189-202, 2003.</ref> ...

{{Short description|4-regular undirected graph with 70 vertices and 140 edges}} ...field of [[graph theory]], the '''Meredith graph''' is a 4-[[regular graph|regular]] [[undirected graph]] with 70 vertices and 140 edges discovered by Guy H. ...

{{Short description|Class of simple graphs defined from vector spaces}} In [[graph theory]], '''Grassmann graphs''' are a special class of [[simple graph]]s defined from systems of [[Linea ...

...y]], the '''Robertson graph''' or '''(4,5)-cage''', is a 4-[[regular graph|regular]] [[undirected graph]] with 19 vertices and 38 edges named after [[Neil Rob ...Math. Soc. 70, 824-825, 1964.</ref> As a cage graph, it is the smallest 4-regular graph with girth 5. ...

...]. We ask: When are two graphs the same? (i.e., [[graph isomorphism]]) The graphs in question may be expressed differently in terms of graph equations.<ref>[ What are the graphs ([[solution (equation)|solutions]]) ''G'' and ''H'' such that the [[line gr ...

...COND">[[Marston Conder|Conder, M.]] and Dobcsányi, P. "Trivalent Symmetric Graphs Up to 768 Vertices." J. Combin. Math. Combin. Comput. 40, 41&ndash;63, 2002 .../Lecture/Lec-7.pdf |title=Yan-Quan Feng and Jin Ho Kwak, ''Cubic s-Regular Graphs'', p. 67. |access-date=2010-03-12 |archive-url=https://web.archive.org/web/ ...

{{Short description|3-regular graph with 12 vertices and 18 edges}} ...mathematical]] field of [[graph theory]], the '''bidiakis cube''' is a 3-[[regular graph]] with 12 vertices and 18 edges.<ref>{{MathWorld|urlname=BidiakisCube ...