New large graphs with given degree and diameter
classification
🧮 math.CO
keywords
graphsdegreedeltadiametergivenadequatebipartiteconstructed
read the original abstract
In this paper we give graphs with the largest known order for a given degree $\Delta$ 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 $(\Delta, D)$ table for graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.