Regular graphs with excess one
From MaRDI portal
Publication:1158437
DOI10.1016/0012-365X(81)90215-6zbMath0473.05036WikidataQ127673969 ScholiaQ127673969MaRDI QIDQ1158437
Publication date: 1981
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (25)
On the non-existence of Abelian Moore Cayley graphs with excess one ⋮ On networks with order close to the Moore bound ⋮ On regular hypergraphs of high girth ⋮ Unnamed Item ⋮ The non-existence of certain regular graphs of girth 5 ⋮ Non-existence of bipartite graphs of diameter at least \(4\) and defect \(2\) ⋮ Graphs of order two less than the Moore bound ⋮ On graphs with excess or defect 2 ⋮ Maximal cubic graphs with diameter 4 ⋮ On the non-existence of antipodal cages of even girth ⋮ Smallest regular graphs of given degree and diameter ⋮ Nonexistence of certain cubic graphs with small diameters ⋮ Diameters of cubic graphs ⋮ On bipartite cages of excess 4 ⋮ Structural properties of graphs of diameter 2 with maximal repeats ⋮ On graphs of defect at most 2 ⋮ Improved lower bounds for the orders of even girth cages ⋮ Approximate Moore graphs are good expanders ⋮ Spectra of orders for \(k\)-regular graphs of girth \(g\) ⋮ The distance coloring of graphs ⋮ On bipartite graphs of defect 2 ⋮ On the existence of graphs of diameter two and defect two ⋮ A continuous analogue of the girth problem ⋮ The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs ⋮ Smallest Vertex-Transitive Graphs of Given Degree and Diameter
Cites Work
This page was built for publication: Regular graphs with excess one
