On the impossibility of certain Moore graphs

DOI10.1016/0095-8956(71)90049-9zbMath0209.55401OpenAlexW2024813022MaRDI QIDQ2543954

H. D. Friedman

Publication date: 1971

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(71)90049-9

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items

On the defect of vertex-transitive graphs of given degree and diameter ⋮ On biregular bipartite graphs of small excess ⋮ On the excess of vertex-transitive graphs of given degree and girth ⋮ High density graphs for processor interconnection ⋮ On existence and regularity of graphs with certain properties ⋮ Improved lower bounds for the orders of even girth cages ⋮ One method for proving the impossibility of certain Moore graphs

Cites Work

• On Moore Graphs with Diameters 2 and 3
• Strongly geodetic graphs