New large graphs with given degree and diameter
Francesc Comellas, J. Gómez
Abstract
In this paper we give graphs with the largest known order for a given degree Δ and diameter D. The graphs are constructed from Moore bipartite graphs by replacement of some vertices by adequate structures. The paper also contains the latest version of the (Δ, D) table for graphs.
Create a lesson
Related papers
Counting with Hiccup Sequences
Benoit Cloitre
Degree similar and net-degree similar signed graphs
Matteo Cavaleri, Alfredo Donno
Clique and chromatic numbers of graph powers: spectral bounds and anticodes
Aida Abiad, Gabriel Coutinho, Hitesh Kumar et al.
Counting cographs in locally dense graphs
Hyunwoo Lee
Two-orbit right-angled Polytopes and Hypertopes
Claudio Alexandre Piedade, Philippe Tranchida
On the failure of additivity of inversion numbers for dijoins
Natalie Behague, Jack Cromwell