There is No Irregular Moore Graph
From MaRDI portal
Cited in
(22)- The maximum girth and minimum circumference of graphs with prescribed radius and diameter
- On the minimum number of edges of two-connected graphs with given diameter
- Packing in regular graphs
- Group connectivity of graphs with diameter at most 2
- Lower bounds on the total domination number of a graph
- Colouring H-free graphs of bounded diameter.
- Total domination in graphs with diameter 2
- Graphs such that every two edges are contained in a shortest cycle
- scientific article; zbMATH DE number 3540829 (Why is no real title available?)
- On the Steiner antipodal number of graphs
- Examples of diameter-2 graphs with no triangle or \(K_{2,t}\)
- Some new upper bounds of \(\operatorname{ex}(n;\{C_3,C_4\})\)
- Characterization of super-radial graphs
- Collapsible graphs and reductions of line graphs
- scientific article; zbMATH DE number 3309927 (Why is no real title available?)
- Steiner radial number of generalized corona
- Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter
- Complexity and algorithms for constant diameter augmentation problems
- A survey on the missing Moore graph
- Improvements in nonlocal metric dimension bounds
- Total domination versus paired-domination in regular graphs
- Moore graphs and cycles are extremal graphs for convex cycles
This page was built for publication: There is No Irregular Moore Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5560920)
