There is No Irregular Moore Graph
From MaRDI portal
Publication:5560920
DOI10.2307/2315106zbMath0173.26303OpenAlexW2326198126WikidataQ29399740 ScholiaQ29399740MaRDI QIDQ5560920
Publication date: 1968
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2315106
Related Items (19)
Group connectivity of graphs with diameter at most 2 ⋮ Unnamed Item ⋮ The maximum girth and minimum circumference of graphs with prescribed radius and diameter ⋮ Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter ⋮ Graphs such that every two edges are contained in a shortest cycle ⋮ Some new upper bounds of \(\operatorname{ex}(n;\{C_3,C_4\})\) ⋮ Moore Graphs and Cycles Are Extremal Graphs for Convex Cycles ⋮ A survey on the missing Moore graph ⋮ On the minimum number of edges of two-connected graphs with given diameter ⋮ Total domination versus paired-domination in regular graphs ⋮ Packing in regular graphs ⋮ Characterization of super-radial graphs ⋮ Unnamed Item ⋮ Lower bounds on the total domination number of a graph ⋮ Collapsible graphs and reductions of line graphs ⋮ Colouring H-free graphs of bounded diameter. ⋮ Complexity and algorithms for constant diameter augmentation problems ⋮ On the Steiner antipodal number of graphs ⋮ Total Domination in Graphs with Diameter 2
This page was built for publication: There is No Irregular Moore Graph
