Largest Known (Degree, Diameter)-Graphs (Description)

Largest Known (Degree, Diameter)-Graphs

Diameter 4

Last modification: October 23, 2026.

https://web.mat.upc.edu/francesc.comellas/old-files/delta-d/taula_delta_d.html

raw adjacency list format: the first vertex of each row is adjacent to all the other vertices in that row.

implicit adjacency list format: each row corresponds to a vertex (row 1, vertex 0; row 2, vertex 1; and so on) and contains all vertices adjacent to it.

adjacency list NX NetworkX format. NetworkX format.

semidirect product Follows the notation of the original contributions from Dinneen and Hafner (arXiv preprint) Networks, 24 (1994) 359-367: Z_m ⋉_a Z_n, of order m·n. Group operation defined as [x,y] × [u,v] = [(x+u) mod m, (y·a^u+v) mod n]].

Doty, vC, AFY

Degree = 3, Diameter = 4; Order =38; Moore bound=46; optimal

Alegre, Fiol, Yebra, von Conta graph ------- Doty graph

Described independently in:

[Do82] K.W. Doty; Large regular interconnection networks; Proc. 3rd. Int. Conf. on Distributed Computing Systems, IEEE Press, Miami, October 1982, pp. 312-317. link to the paper (local)
[vCo83] C. von Conta. Torus and other networks as communication networks with up to some hundred points. IEEE Trans Comp,c-32 (1983), pp. 657-666.
[AlFiYe86] I. Alegre, M.A. Fiol and , J.L.A Yebra. Some large graphs with given degree and diameter. J. Graph Theory,10 (1986), pp.219-224.

The proof of optimality appeared in:

Dominique Buset. Maximal cubic graphs with diameter 4. Discrete Appl. Math.101 (2000) pp. 53--61.

The graph constructed by K.W. Doty is not isomorphic to the other graphs (which are)

Download the adjacency list of the graph AFY in NetworkX format (vertices notation as in AlFiYe86).

Download the adjacency list of the graph AFY in NetworkX format (vertices labeled 0,2,...37). This graph has average distance 3.10811. Automorphism group size: 8. More information at The House of Graphs.

Download the adjacency list of the Doty graph in NetworkX format (vertices labeled 0,2,...37). This graph has average distance 3.11664. Automorphism group size: 16. More information at The House of Graphs.

--------------------

This SageMath script computes several properties of the graphs including symmetry group sizes and the number of k-cycles (k=3..10). This is the online version .

Bhakar_104

Degree = 4, Diameter = 4; Order =104; Moore bound=161;

Nishant Bhakar (nishant.bhakar@gmail.com, Redmond, WA, USA; August 27, 2026) found three non-isomorphic graphs with 104 vertices and 208 edges. One of them with a high symmetry.

The construction is a Z_8-voltage graph lift of a 13-vertex base multigraph with loops and semi-edges, followed by a symmetry-breaking repair obtained through iterative experimentation with different approaches, with Claude Fable assisting with implementation and the analysis and summarization of the results..

** Download the 104c_d4D4.txt edge list of the graph.

** Download the 104b_d4D4.txt edge list of a non-isomorphic graph.

** Download the 104_d4D4.txt edge list edge list of another non-isomorphic graph.

This SageMath script computes several properties of the graph. This is the online version .

Former result, order 100

Graph constructed by Gavin Uberti (gavin.uberti@gmail.com>; August 22, 2026).

It was found as part of his work; 4-regular graphs are useful in semiconductors because that is the maximum number of x16 PHYs that can be placed horizontally on the bottom of a standard 26x33mm reticle.

Download the edge list of the graph.

This SageMath script computes several properties of the graph. This is the online version .

Former result, order 98

Communicated by G. Exoo (May 19, 2010). G.E. data

Download the implicit adjacency list of the graph. adjlist NX format

This SageMath script computes several properties of the graphs including symmetry group sizes and the number of k-cycles (k=3..). This is the online version

Rajiv_252

Degree = 5, Diameter= 4; Order=252; Moore bound=426;

Obtained by Rishabh Rajiv (rishabh.rajiv@alumni.ubc.ca, September 24, 2026) with the use of AI agentic coding systems. Orbit graph from G = A₇, of order 2520, with orbits V1,V2,V3 of sizes 42,105,105 and stabilizers of orders 60,24,24.

In this link https://doi.org/10.5281/zenodo.22928337 you can download the edge list, a paper and information detailing the construction of the graph.

Download the local edge list of the graph.

This SageMath script computes several properties of the graph, including symmetry group sizes and the number of k-cycles (k=3..). This is the online version

Former result, order=212

Communicated by Eyal Loz, Math Dep., Auckland Univ., New Zealand (July 2006)

G.E. data

Download the implicit adjacency list of the graph. adjlist NX format

This SageMath script computes several properties of the graph, including symmetry group sizes and the number of k-cycles (k=3..). This is the online version

Rajiv_441

Degree= 6, Diameter = 4; Order =441; Moore bound=937

Obtained by Rishabh Rajiv (rishabh.rajiv@alumni.ubc.ca, Septembert 24, 2026) with the use of AI agentic coding systems. Orbit graph from G= PSU(3,3), of order 6048, with orbits V1,V2,V3 of sizes 63,189,189 and stabilizers of orders 96,32,32.

In this link https://doi.org/10.5281/zenodo.22928337 you can download the edge list, a paper and information detailing the construction of the graph.

Download the local edge list of the graph.

This SageMath script computes several properties of the graph, including symmetry group sizes and the number of k-cycles (k=3..). This is the online version

Former result, order=390

Communicated by Eyal Loz, Math Dep., Auckland Univ., New Zealand (July 2006)

Voltage graph Z_15 x(3) Z_13, D(2,2), voltages [(2,8)<>(14,4),(0,0)<>(13,6),(9,4)<>(7,7)], avg. dist.: 3.444730

Z_m x(a) Z_n represents a semidirect product of cyclic groups [x,y][u,v]= [x + u mod m, y*a^u + v mod n].

Download the raw adjacency list of the graph. adjlist NX format

Link to Eyal Loz's data (internet archive) .

This SageMath script computes several properties of the graph, including symmetry group sizes and the number of k-cycles (k=3..). This is the online version

Michel_684

Degree= 7, Diameter = 4; Order =684; Moore bound=1814

Obtained by Michel de Messieres (michel@demessieres.com, October 5, 2026). The search programs were written and run by an AI assistant (Anthropic's Claude) under the author's direction. Lift of a voltage graph with two vertices over the semidirect product of cyclic groups Z₉ (⋊₂₃) Z₃₈. Each vertex type has four neighbours of its own type and 3 of the other type. The automorphism group is the lifted group, with two orbits, so the graph is not vertex-transitive. They were found by a computer search over such groups of order just above half the former entry , optimising the voltages by simulated annealing until every pair of vertices was within distance 4.

The graph and a detailed write-up are also on Zenodo https://doi.org/10.5281/zenodo.23167440

Download the edge list of the graph.

This SageMath script computes several properties of the graphs. This is the online version .

Former result, order=672

Obtained as a Cayley graph for semidirect product of Zm with Zn

Z₆ (⋊₃₉) Z₁₁₂ [2,73]<>[4,23], [5,54]<>[1,22], [5,71]<>[1,31], [3,42] avg.dist 3.496274

M. Sampels. Large networks with small diameter.. In: Rolf H. Mohring (Ed.): 23rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG '97), Lecture Notes in Computer Science 1335, pp. 288-302, Springer-Verlag, 1997 ISBN 3-540-63757-5. Communicated July 29, 1997

Download the raw adjacency list of the graph in NetworkX format (vertices labeled 0,2,...671) .

Other instances (F.Comellas 2024)

Z₆ (⋊₂₃) Z₁₁₂ [2,95]<>[4,97], [1,77]<>[5,21], [5,36]<>[1,68], [3,56] Avg.dist 3.496274 transm. 2346 adjlist NX

Z₆ (⋊₂₃) Z₁₁₂ [1,102]<>[5,54], [2,51]<>[4,45], [5,83]<>[1,107], [3,42] Avg.dist 3.496274 transm. 2346 adjlist NX

Z₆ (⋊₂₃) Z₁₁₂ [4,101]<>[2,107], [5,64]<>[1,96], [5,101]<>[1,29], [3,84] Avg.dist 3.496274 transm. 2346 adjlist NX

Z₆ (⋊₂₃) Z₁₁₂ [2,65]<>[4,31], [1,22]<>[5,38], [5,85]<>[1,61], [3,98] Avg.dist 3.496274 transm. 2346 adjlist NX

Z₆ (⋊₃₉) Z₁₁₂ [2,23]<>[4,41], [1,0]<>[5,0], [1,103]<>[5,95], [3,28] Avg.dist 3.496274 transm. 2346 adjlist NX

Z₆ (⋊₃₉) Z₁₁₂ [2,5]<>[4,43], [5,73]<>[1,65], [1,28]<>[5,28], [3,0] Avg.dist 3.496274 transm. 2346 adjlist NX

Z₆ (⋊₃₉) Z₁₁₂ [4,57]<>[2,103], [5,30]<>[1,62], [1,101]<>[5,29], [3,42] Avg.dist 3.496274 transm. 2346 adjlist NX

Z₆ (⋊₃₉) Z₁₁₂ [5,48]<>[1,32], [2,9]<>[4,55], [5,33]<>[1,57], [3,84] Avg.dist 3.496274 transm. 2346 adjlist NX

--------------------

This SageMath script computes several properties of two of the graphs including symmetry group sizes. This is the online version .

Loz_1100

Degree= 8, Diameter = 4; Order =1100; Moore bound=3201

Communicated by Eyal Loz, Math Dep., Auckland Univ., New Zealand (July 2006)

Voltage graph Z₂₀ (⋊₂) Z₅₅, B(0,4), voltages [(4, 27)(12, 11)(9,9)(19, 11)], avg. dist.: 3.547771

Z_m (⋊_a) Z_n represents a semidirect product of cyclic groups [x,y][u,v]= [x + u mod m, y*a^u + v mod n].

Download the raw adjacency list of the graph. Link to Eyal Loz's data (internet archive) .

Found also as a Cayley graph semidirect product, some instances have a lower average distance (F.Comellas 2023):

Z₂₀ (⋊₂) Z₅₅ with generators [1,45]<>[19,5]:[12,47]<>[8,13]:[11,39]<>[9,52]:[16,26]<>[4,24]. Avg. dist. 3.547771 (1,8,56,361,674) trans.: 3899 adjlist NX

Z₂₀ (⋊₃) Z₅₅ with generators [9,8]<>[11,9]:[1,39]<>[19,42]:[8,1]<>[12,24]:[12,22]<>[8,33]. Avg. dist. 3.536852 (1,8,56,373,662) trans.: 3887 adjlist NX

Z₂₀ (⋊₃) Z₅₅ with generators [1,33]<>[19,44]:[8,13]<>[12,37]:[9,2]<>[11,16]:[12,44]<>[8,11]. Avg. dist. 3.536852 (1,8,56,373,662) trans.: 3887 adjlist NX

Z₂₀ (⋊₈) Z₅₅with generators [16 9]<>[4 41]:[7 10]<>[13 50]:[17 12]<>[3 16]:[12 8]<>[8 37]. Avg. dist. 3.547771 adjlist NX

Z₂₀ (⋊₈) Z₅₅ with generators [12,54]<>[8,16]:[16,2]<>[4,3]:[13,16]<>[7,23]:[17,37]<>[3,31]. Avg. dist. 3.547771 adjlist NX

Z₂₀ (⋊₃₈) Z₅₅with generators [7,18]<>[13,16]:[16,54]<>[4,31]:[3,35]<>[17,5]:[4,48]<>[16,2]. Avg. dist. 3.536852 (1,8,56,373,662) trans.: 3887 adjlist NX

Z₂₀ (⋊₄₇) Z₅₅with generators [8,43]<>[12,42]:[11,8]<>[9,34]:[19,17]<>[1,26]:[12,54]<>[8,16]. Avg. dist. 3.536852 (1,8,56,373,662) trans.: 3887 adjlist NX

Z₂₀ (⋊₄₈) Z₅₅with generators [11,5]<>[9,40]:[19,16]<>[1,2]:[12,3]<>[8,17]:[8,11]<>[12,44]. Avg. dist. 3.536852 (1,8,56,373,662) trans.: 3887 adjlist NX

--------------------

This SageMath script computes several properties of two of the graphs including symmetry group sizes. This is the online version .

Dhar_1770

Degree= 9, Diameter = 4; Order =1770; Moore bound=5266.

Dharunish Yugeswardeenoo (dharyugi@gmail.com; Chalfont, PA, USA; November 4, 2026). Results obtained by using a hybrid discovery framework in development: LLM-guided search over classical algebraic constructions, combined with local search and exact completion. The specific LLMs used were OpenAI's Sol 5.6 and Anthropic's Claude Fable 5 Max.

Build from the graph below, (9,4) = 1768 (F. Comellas).

In this link (doi:10.5281/zenodo.23936153) you can download the adjacency list of this graph.

Download the local raw adjacency list of the graph.

This SageMath script computes several properties of the graphs including symmetry group sizes and the number of k-cycles (k=3..). This is the online version .

Former result, order=1768

Obtained by Francesc Comellas (October 21, 2026), with the help of OpenAI GPT 6 Astra.

The base graph is G_9_4_n1700.edges, a 9-regular, diameter 4, graph with 1700 vertices (unknown author). This graph is a Z₂ lift of the generalized-quadrangle incidence graph with spread twins W(7). From this graph 191 edges are removed and 68 vertices and 497 edges added through a process that use simulated annealing for vertex insertions, repeated edge pruning and alternative attachment exchanges.

Download the local edge list of this graph. This SageMath script computes several properties of the graphs. This is the online version .

Former result, Order = 1640

Cayley graph. Found as a semidirect product, 1640 nodes and 7380 (F.Comellas 2024):

Z₄₀ (⋊₂₂) Z₄₁, generators [23,14]<>[17,33]:[25,18]<>[15,13]:[27,35]<>[13,33]:[2,23]<>[38,8]:[20,3]<>[20,3]. Avg. dist.: 3.571080 (1,9,72,532,1026) transmission: 5853. adjlist NX
Z₄₀ (⋊₂₄) Z₄₁,, generators [25,28 ]<>[15,2 ]:[14,40 ]<>[26,33 ]:[29,11 ]<>[11,39 ]:[39,12 ]<>[1,40 ]:[20,35 ]<>[20,35 ]. Avg. dist.: 3.571080 (1,9,72,532,1026) transmission: 5853. adjlist NX

The two graphs are isomorphic.

--------------------

This SageMath script computes several properties of the graphs including symmetry group sizes. This is the online version .

--------------------

Former result, Order =1550

Communicated by Eyal Loz, Math Dep., Auckland Univ., New Zealand (July 2006)

Voltage graph Z_10 x(4) Z_155, B(1,4), voltages [(5, 0)|(7, 1)(4, 52)(6, 136)(1, 72)], avg. dist.: 3.555197

Z_m x(a) Z_n represents a semidirect product of cyclic groups [x,y][u,v]= [x + u mod m, y*a^u + v mod n].

Download the raw adjacency list of the graph. Link to Eyal Loz's data (internet archive)

Found also as a semidirect product (F.Comellas 2023):

Z_10 x(4) Z_155 with generators [9,55]<>[1,90]:[6,126]<>[4,139]:[3,98]<>[7,13]:[6,142]<>[4,73]:[5,31]. Avg. dist. 3.555197 adjlist NX

Z_10 x(39) Z_155; generators [6,79]<>[45,6]:[9,1]<>[1,116]:[6,57]<>[4,113]:[3,130]<>[7,50]:[5,124]. Avg. dist. 3.555197 adjlist NX

Z_10 x(64) Z_155 with generators[9,132]<>[1,77]:[8,153]<>[2,132]:[7,19]<>[3,34]:[2,71]<>[8,114]:[5,0]. Avg. dist. 3.555197 adjlist NX

Dhar_2566

Degree= 10, Diameter = 4; Order =2566; Moore bound=8201.

Build from the graph below, (10,4) = 2557 (F. Comellas).

In this link (doi:10.5281/zenodo.23936153) you can download the adjacency list of this graph.

Download the local raw adjacency list of the graph.

This SageMath script computes several properties of the graphs including symmetry group sizes and the number of k-cycles (k=3..). This is the online version .

Former result, order=2557

Obtained by Francesc Comellas (November 2, 2026), with the help of OpenAI GPT 6 Astra.

Starting from the 2,556-vertex graph below, we added a new vertex connected to the two degree-9 vertices and to the endpoints of four removed edges, giving every vertex degree 10. Two degree-preserving edge switches then repaired the remaining distance defects. Overall, the construction removes seven original edges and adds thirteen, producing a 10-regular graph on 2,557 vertices with 12,785 edges and diameter exactly 4.

Download the local edge list of this graph.

This SageMath script computes several properties of the graphs. This is the online version .

Former result, Order = 2556

Obtained by Rishabh Rajiv (October 30, 2026), with the help of Anthropic's Claude Fable 5.1 and Opus 5.5 (AI models), which generated hypotheses, wrote the search, analysis and verification software as autonomous coding agents, and guided the allocation of computing resources.

Graph constructed by a slack-filling procedure applied to a previously known (10,4) graph. The construction begins by deleting selected edges from the original graph, creating vertices with spare degree (slack). New vertices and edges are then introduced using this available degree capacity, with local adjustments to restore the required diameter while ensuring that no vertex has degree greater than 10.

In this link (doi:10.5281/zenodo.23788455) you can download the adjacency list, a verifier (standard-library Python, no dependencies), and a paper describing the construction of the graph.

Download the local edge list of this graph.

This SageMath script computes several properties of the graphs. This is the online version .

Former result, Order = 2485

Dharunish Yugeswardeenoo (dharyugi@gmail.com; August 17,2026). Results obtained by using a hybrid discovery framework in development: LLM-guided search over classical algebraic constructions, combined with local search and exact completion. The specific LLMs used were OpenAI's Sol 5.6 and Anthropic's Claude Fable 5 Max. Cayley graph Z₃₅ (⋊₂) Z₇₁ , generators: (18,57)<>(17,13), (12,66)<>(23,3), (29,12)<>(6,13), (33,22)<>(2,54), (14,27)<>(21,35). Avg. dist.: 3.619968. Dist. distrib . [1, 10, 90,734, 1650]

Download the raw adjacency list .

This SageMath script computes several properties of the graphs including symmetry group sizes and the number of k-cycles (k=3..). This is the online version .

Former result, order=2331

(10,4)=2331. Cayley graphs. Found as semidirect products, 2331 vertices, 11655 edges (F.Comellas 2024):

Z₉ (⋊₄₄) Z₂₅₉ , generators [8,132] [2,171] [2,71] [4,236] [6,240]. Avg. dist.: 3.580258 (1,10,90,768,1462) transmission: 8342. adjlist NX

This SageMath script computes several properties of the four graphs including symmetry group sizes. This is the online version .

Dhar_3654

Degree = 11, Diameter = 4; Order = 3654; Moore bound=12222.

Build from the graph below, (11,4) = 3646 (F. Comellas).

In this link (doi:10.5281/zenodo.23936153) you can download the adjacency list of this graph.

Download the local raw adjacency list of the graph.

This SageMath script computes several properties of the graphs including symmetry group sizes and the number of k-cycles (k=3..). This is the online version .

Former result, order=3646

Obtained by Francesc Comellas (November 2, 2026), with the help of OpenAI Codex GPT 6 Astra.

The base graph is the graph below, with 3645 vertices, degree 11 and diameter 4. A new vertex was initially connected using seven spare degree slots and two edge subdivisions, then the graph was repaired through degree-preserving edge switches. The final construction removes 116 original edges and adds 125 edges, giving 20053 edges in total.

Download the local edge list of this graph.

This SageMath script computes several properties of the graphs. This is the online version .

Former result, Order =3645

Obtained by Nishant Bhakar (nishant.bhakar@gmail.com, Redmond, WA, USA; October 27, 2026), who set the research, selected the topics to pursue, and reviewed the results. Claude Fable assisted with the computational searches, code development, analysis, and summarization of the results.

This graph with maximum degree 11, diameter 4, and 3645 vertices is constructed by extending Dharunish Yugeswardeenoo's 3444-vertex graph (see below), based on a double cover of the incidencegraph of the generalized quadrangle W(9). The original graph has two copies of each of the 820 points and 820 lines of W(9), with the two copies of every line joined by an edge, and 164 additional twin vertices associated with a spread of 82 disjoint lines. Starting from this 11-regular graph, 201 vertices are added successively by a procedure that deletes selected edges and replaces them with paths through new vertices. Each new vertex is joined to both copies of a point, to the two vertices disconnected from them, and to some previously added vertices. The edge modifications are chosen to preserve the maximum degree and diameter, using local search and SAT-assisted completion. The resulting graph has 3645 vertices and 20044 edges, with 3638 vertices of degree 11 and 7 of degree 10. Its diameter is exactly 4.

In this link github.com/f4t4nt/degree-diameter-graphs you can download the adjacency list, a detailed report on the construction of the graph and a paper.

Download the local edge list of this graph.

This SageMath script computes several properties of the graphs. This is the online version .

Former result, Order = 3444

Dharunish Yugeswardeenoo (dharyugi@gmail.com; Chalfont, PA, USA; October 7, 2026). Results obtained by using a hybrid discovery framework in development: LLM-guided search over classical algebraic constructions, combined with local search and exact completion. The specific LLMs used were OpenAI's Sol 5.6 and Anthropic's Claude Fable 5 Max.

Incidence graph of the symplectic generalized quadrangle W(9) (820 points, 820 lines, 10-regular, diameter 4, girth 8), doubled: every vertex gets two copies and a base edge a-b carrying a voltage x in {0,1} joins (a,i) to (b,i+x). The voltages are chosen (by local search) so that for each of the 597,780 pairs of opposite vertices the 10 geodesics between them do not all have the same voltage sum; both copies of the far vertex are then reached in 4 steps. The two copies of every line are joined to each other, which settles all pairs at base distance less than 4 and leaves each of the 1,640 point-copies one free slot. Those slots carry 164 twin vertices: for each of the 82 lines of a spread and each of the two sheets, a new vertex joined to the 10 point-copies adjacent to that copy of the line; the two twins of a spread line are adjacent. 3,280 + 164 = 3,444 vertices, 11-regular, diameter 4.

Download the raw adjacency list of the graph.

This SageMath script computes several properties of the graphs including symmetry group sizes and the number of k-cycles (k=3..). This is the online version .

Former result, order=3235

Q₇(T₄)+ Dharunish Yugeswardeenoo (dharyugi@gmail.com; Sept. 14, 2026). Results obtained by using a hybrid discovery framework in development: LLM-guided search over classical algebraic constructions, combined with local search and exact completion. The specific LLMs used were OpenAI's Sol 5.6 and Anthropic's Claude Fable 5 Max.

Obtained from the P. Isufi's 3,220-vertex graph Q7(T4)+ (below): two of its vertices and 47 other edges are deleted, 10 new edges are added between original vertices, and 17 new vertices are added, joined to original vertices (172 edges) and to each other (7 edges). Degree histogram:

Download the raw adjacency list of the graph.

This SageMath script computes several properties of the graphs including symmetry group sizes and the number of k-cycles (k=3..). This is the online version .

Former result, order=3220

Graph constructed with the help of AI tools by Petrit Isufi (isufi.petrit@proton.me; Wuppertal, Germany. August 17, 2026).

After constructing Q₇(T₄) based on the published details (see below), as the graph is regular, no new vertices can be added without increasing the degrees. Edges are deleted and each deletion is accepted only after an exact re-check that the diameter is still 4, then new vertices are added one at a time by exact CP-SAT, each joined only to freed vertices, none joined to each other. After 215 deletions and 20 new vertices, the final graph has 3220 nodes and 17605 edges, maximum degree 11, and diameter 4, average degree 10.935, degree histogram [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 210, 3010] and avg. dist.: 3.662781.

Download the edge list of the graph.

This SageMath script computes several properties of the graph. This is the online version .

Former result,, order=3202

Dharunish Yugeswardeenoo (dharyugi@gmail.com; August 17, 2026). Addition of two vertices to the graph below. Results obtained by using a hybrid discovery framework in development: LLM-guided search over classical algebraic constructions, combined with local search and exact completion. The specific LLMs used were OpenAI's Sol 5.6 and Anthropic's Claude Fable 5 Max. Download the raw adjacency list .

Former result, order=3200

Q₇(T₄) J. Gomez, M.A. Fiol. Dense Compound Graphs.Ars Combinatoria, 20-A (1985), pp. 211-237. link to the paper

Download the edges list of the graph (thanks to Petrit Isufi).

Bhakar_6156

Degree = 12, Diameter = 4; Order=6156; Moore bound= 17569.

This 12-regular graph with diameter 4 and 6156 vertices is constructed as a route-chart lift over F₃⁴ of a 4-regular controller graph on 76 vertices. The controller is a voltage lift over Z₁₉ of a four-vertex Schreier base defined by the permutations a = (0 1 2 3) and b = (0 1 3 2), with voltage assignments (0,12,4,0) and (17,0,0,1), respectively. Each controller vertex v is replaced by a fibre of 3⁴ = 81 points (v,x), where x belongs to F₃⁴. For each directed controller edge v → w labelled by t ∈ {a, a^-1, b, b^-1}, the point (v,x) is joined to the three points (w, M_tx + λd_t), where λ ∈ F₃ and M_t and d_t are specified matrices and vectors over F₃. The resulting graph has 76·81 = 6156 vertices and 36936 edges, is 12-regular, and has diameter 4.

In this link github.com/f4t4nt/degree-diameter-graphs you can download the adjacency list, a detailed report on the construction of the graph and a paper.

Download the local edge list of this graph.

This SageMath script computes several properties of the graphs. This is the online version .

Former result, Order = 5832

Construction discovered by Ryosuke Mizuno (mizuno@aisystemresearch.com, September 25, 2026) through interaction with ChatGPT via its standard web interface. A simple 12-regular route-chart lift graph on V(C) × F⁴₃, where C is a 72-vertex simple 4-regular controller. The graph has 34,992 edges and diameter exactly 4. This uses the route-chart lift definition in [arXiv:2606.15860] with a different diameter certificate: nonsingular controllability matrices for selected length-4 walks, pencils of affine hyperplanes, and unions of affine planes establish the upper bound 4

More details in Mizuno's "degree16-diameter3" github folder

Download the local edge list of the graph.

This SageMath script computes several properties of two of the graphs including symmetry group sizes. This is the online version .

Former result, order=5184

Ccmmunicated Sep 18, 2026 (contact: lmonroe@lanl.gov). Graph-lift construction found using agentic tool URSA ( https://lanl.github.io/ursa LA-UR-26-28353) by J. Amarel, N. DeBardeleben, M. Grosskopf, V. Job, E. Lawrence, L. Monroe and R Somasundaram (LANL)

Download the raw adjacency list of the graph.

This SageMath script computes several properties of the graphs including symmetry group sizes and the number of k-cycles (k=3..). This is the online version .

Former result Q′₈*X₈++, order=4785

Dharunish Yugeswardeenoo (dharyugi@gmail.com; Sept. 14, 2026). Results obtained by using a hybrid discovery framework in development: LLM-guided search over classical algebraic constructions, combined with local search and exact completion. The specific LLMs used were OpenAI's Sol 5.6 and Anthropic's Claude Fable 5 Max.

Obtained from P. Isufi's 4705-vertex graph (former result below): one of its vertices and 378 other edges are deleted, 8 new edges are added between original vertices, and 81 new vertices are added, joined to original vertices (953 edges) and to each other (9 edges). 24 vertices have degree 11. Degree histogram:

Download the raw adjacency list of the graph.

This SageMath script computes several properties of the graphs including symmetry group sizes and the number of k-cycles (k=3..). This is the online version .

Former result, order=4707

Graph constructed with the help of AI tools by Petrit Isufi (isufi.petrit@proton.me; Wuppertal, Germany. August 27, 2026).

An improvement on the former entry with 4705 graph. That graph has 223 vertices of degree below 12 ("free stubs"), so a search an exact CP-SAT model whether new vertices can be attached to those free slots without breaking diameter 4 lead to that two could be, giving 4707; a third is infeasible on that pinned choice, which is not a proof that 4708 is impossible. The new graph has | Ord.: 4707 / Size: 28142 / Diam.: 4 / Avg.dist: 3.72432 / Girth: 3 / Degree histogram : [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 200, 4507]

Download the edge list of the graph.

This SageMath script computes several properties of the graph. This is the online version .

Former result Q′₈*X₈+, order 4705.

Graph constructed with the help of AI tools by Petrit Isufi (isufi.petrit@proton.me; Wuppertal, Germany. August 17, 2026).

After constructing Q′₈*X₈ based on the published details (Delorme's q = 8 polarity quotient, star-multiplied with the X8 factor of Bermond-Delorme-Farhi) a graph with 4680 vertices, 27820 edges, degree distribution 520 x 11 + 4160 x 12, maximum degree 12, diameter 4, is obtained. Then 25 new vertices were added (with no edges between the new vertices; every new edge is incident with a vertex of degree 11 in the former graph) obtaining a new graph with 4705 vertices, 28118 edges, maximum degree 12, and diameter 4. The greedy search method could not add a 26th vertex. The new graph has order.: 4705 / size: 28118 / diam.: 4 / avg.dist: 3.72455 / girth: 3 / degree histogram [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 222, 4482]

Download the edge list of the graph.

This SageMath script computes several properties of the graph. This is the online version .

Former result, order 4680.

Q′₈*X₈ with 4680 vertices. Special product of bibartite graphs from C. Delorme.

C. Delorme. Grands graphes de degré et diamètre donnés.Eur. J. Comb. 6 (1985), pp. 291-302. (submitted 1982) link to the paper

Download the edges list of the graph (thanks to Petrit Isufi).

Bhakar_6804

Degree = 13, Diameter = 4; Order= 6804; Moore bound= 24506.

This 13-regular graph with diameter 4 and 6804 vertices is constructed as a route-chart lift over F₃⁴ of a 5-regular Cayley controller graph on 84 vertices. The controller is the Cayley graph of the semidirect product Z₇ ⋊₂ Z₁₂, with generators a = xy, b = y⁴, their inverses, and the central involution z = y⁶, where x⁷ = y¹² = 1 and yxy^-1 = x². Each controller vertex v is replaced by a fibre of 3⁴ = 81 points (v,p), with p ∈ F₃⁴. For each directed controller edge v → w labelled by t ∈ {a, a^-1, b, b^-1}, the point (v,p) is joined to the three points (w, M_tp + λd_t), where λ ∈ F₃ and M_t and d_t are specified matrices and vectors over F₃. The involution z contributes one additional edge (v,p)–(z(v), −p + c_z), where c_z = (0,0,1,0). The resulting graph has 84·81 = 6804 vertices and 44226 edges, is 13-regular, and has diameter 4.

In this link github.com/f4t4nt/degree-diameter-graphs you can download the adjacency list, a detailed report on the construction of the graph and a paper.

Download the local edge list of this graph.

This SageMath script computes several properties of the graphs. This is the online version .

Former result, Order = 6646

Q₉(T₄)++ Obtained by Francesc Comellas (October 23, 2026), with the help of OpenAI GPT 6 Astra.

The base graph is G_13_4_n6630.edges , with maximum degree 13, diameter 4, and 6630 vertices (unknown author). This graph comes from Rajiv's (13,4) graph with 6 611 vertices, by inserting new vertices and joining them to vertices with free degree, with edge rewiring, when needed. It has degrees [11: 4, 12: 10, 13: 6 616]. A process that use simulated annealing for vertex and edge insertions, repeated edge pruning and alternative attachment exchanges allows the construction of the final graph.

Download the local edge list of this graph. This SageMath script computes several properties of the graphs. This is the online version .

Former result, Order = 6615

Q₉(T₄)++ Dharunish Yugeswardeenoo (dharyugi@gmail.com; Chalfont, PA, USA; October 7, 2026). Results obtained by using a hybrid discovery framework in development: LLM-guided search over classical algebraic constructions, combined with local search and exact completion. The specific LLMs used were OpenAI's Sol 5.6 and Anthropic's Claude Fable 5 Max.

4 new vertices are added to the 6,611-vertex (13,4) graph of R. Rajiv: 59 of its edges are deleted and 73 new edges added between original vertices; each new vertex has degree 13 and the new vertices are not adjacent to each other.

Download the raw adjacency list of the graph.

Former result, order=6611

Q₉(T₄)++ Obtained by Rishabh Rajiv (rishabh.rajiv@alumni.ubc.ca, Septembert 30, 2026) with the use of AI agentic coding systems Anthropic's Claude Fable 5.1 and Opus 5.5. Modification of a previous entry.

In this link: https://doi.org/10.5281/zenodo.23052995 you can download the details and a paper describing the construction of the graph.

Former result, order=6600

Q₉(T₄)+. Dharunish Yugeswardeenoo (dharyugi@gmail.com; Sept. 14, 2026). Results obtained by using a hybrid discovery framework in development: LLM-guided search over classical algebraic constructions, combined with local search and exact completion. The specific LLMs used were OpenAI's Sol 5.6 and Anthropic's Claude Fable 5 Max.

Obtained from P. Isufi's 6,587-vertex graph Q9(T4)+ (below): three of its vertices and 64 other edges are deleted, 25 new edges are added between original vertices, and 16 new vertices are added, joined to original vertices (178 edges) and to each other (15 edges). 168 vertices have degree 12.Degree histogram:

Download the raw adjacency list of the graph.

This SageMath script computes several properties of the graphs including symmetry group sizes and the number of k-cycles (k=3..). This is the online version .

Former result, order=6587

Q₉(T₄)+. Graph constructed with the help of AI tools by Petrit Isufi(isufi.petrit@proton.me; Wuppertal, Germany. August 17, 2026).

After constructing Q₉(T₄) based on the published details (see below), as the graph is regular, no new vertices can be added without increasing the degrees. Edges are deleted and each deletion is accepted only after an exact re-check that the diameter is still 4, then new vertices are added one at a time by exact CP-SAT, each joined only to freed vertices, none joined to each other. After 290 deletions and 27 new vertices, the final graph has 6587 nodes and 42701 edges, maximum degree 13, and diameter 4, average degree 12.965 , degree histogram [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 229, 6358] and avg. dist.: 3.715966.

Download the edge list of the graph.

This SageMath script computes several properties of the graph. This is the online version .

Former result, order=6560

Q₉(T₄); J. Gomez, M.A. Fiol. Dense Compound Graphs.Ars Combinatoria, 20-A (1985), pp. 211-237. link to the paper

Download the edges list of the graph (thanks to Petrit Isufi).

Bhakar_9720

Degree = 14, Diameter = 4; Order =9720; Moore bound= 33321.

A 14-regular graph with diameter 4 and 9720 vertices is constructed as a route-chart lift over F₃⁴ of a 6-regular Cayley controller graph on 120 vertices. The controller is the Cayley graph of G = SL(2,3) × Z₅, with generators a = ([[0,1],[2,2]],1), b = ([[0,1],[2,1]],2), and p = (I,1), together with their inverses, where I is the 2×2 identity matrix over F₃. Each controller vertex v is replaced by a fibre of 3⁴ = 81 points (v,x), with x ∈ F₃⁴. For each directed controller edge v → w labelled by t ∈ {a, a^-1, b, b^-1}, the point (v,x) is joined to the three points (w, M_tx + λd_t), where λ ∈ F₃ and M_t and d_t are specified matrices and vectors over F₃. The generators p and p^-1 contribute two additional edges, joining (v,x) to (p(v), −x + c) and (p^-1(v), −x + c), where c = (2,0,2,2). The resulting graph has 120·81 = 9720 vertices and 68040 edges, is 14-regular, and has diameter 4.

In this link github.com/f4t4nt/degree-diameter-graphs you can download the adjacency list, a detailed report on the construction of the graph and a paper.

Download the local edge list of this graph.

This SageMath script computes several properties of the graphs. This is the online version .

Former result, Order = 8434

Obtained by Francesc Comellas (October 23, 2026), with the help of OpenAI GPT 6 Astra.

The base graph is G_14_4_n8424.edges.txt , with maximum degree 14, diameter 4, and 8424 vertices (unknown author). This graph comes as an affine frame lift of Bhakar's (4,4) graph. Vertices (u, p) with u a vertex of Nishant Bhakar's (4,4) graph on 104 vertices and p ∈ F₃⁴; for every arc u ⟶ w of an orientation of the controller and every λ ∈ F₃ (u,p) ∼ (w, A_uw p + c_uw + λ b_uw) (12 edges per vertex), plus one in-fibre edge (u,p) ∼ (u, p + t_u) (degree 14). N = 81·104=8434. This graph with 8434 vertices is obtained by extending the former(14,4) graph on 8424 vertices through a process that uses simulated annealing for vertex and edge insertions, repeated edge pruning and alternative local attachment exchanges which allows the construction of the final graph. The construction removes 130 edges between original vertices and introduces 10 new vertices, each joined to 14 original vertices, adding 140 edges. Of the 260 original vertices affected by the deletions, 140 recover their lost connection through the new vertices, while the remaining 120 lose one degree. No original vertex increases its degree, and the maximum degree remains at most 14.

Download the local edge list of this graph. This SageMath script computes several properties of the graphs. This is the online version .

Former result, Order = 8303

Q₉(T₅)+ Obtained by Michel de Messieres (michel@demessieres.com, October 3, 2026). The search programs were written and run by an AI assistant (Anthropic's Claude) under the author's direction. Rajiv's graph has 357 vertices with unused degree (450 unused slots). We kept ALL 57,791 of its edges and added 15 new vertices of degree 14 (190 edges to original vertices, 10 between new vertices) plus 129 new edges between original vertices in their unused slots. This was done in two steps: first 14 new vertices (8302), then 1 more (8303), each time placing the added edges by annealing until every pair of vertices was within distance 4. Vertices 0--8287 are Rajiv's vertices with his original numbering; 8288?8302 are the new ones.

The graph and a detailed write-up are also on Zenodo https://doi.org/10.5281/zenodo.23136968

Download the edge list of the graph.

This SageMath script computes several properties of the graphs. This is the online version .

Former result, order=8208

Obtained by Rishabh Rajiv (rishabh.rajiv@alumni.ubc.ca, Septembert 30, 2026) with the use of AI agentic coding systems Anthropic's Claude Fable 5.1 and Opus 5.5. Modification of a previous entry.

In this link: https://doi.org/10.5281/zenodo.23052995 you can download the details and a paper describing the construction of the graph.

This SageMath script computes several properties of the graphs including symmetry group sizes and the number of k-cycles (k=3.). This is the online version .

Former result, order=8266

Obtained from P. Isufi's 8,255-vertex graph Q9(T5)+ (below): two of its vertices and 89 other edges are deleted, and 13 new vertices are added, joined to original vertices (167 edges) and to each other (5 edges); no edges are added between original vertices. 94 vertices have degree below 14 (120 free slots). Degree histogram:

Download the raw adjacency list of the graph.

This SageMath script computes several properties of the graphs including symmetry group sizes and the number of k-cycles (k=3..). This is the online version .

Former result, order=8255

Graph constructed with the help of AI tools by Petrit Isufi (isufi.petrit@proton.me; Wuppertal, Germany. August 17, 2026).

After constructing Q₉(T₅) based on the published details (see below), as the graph is regular, no new vertices can be added without increasing the degrees. Edges are deleted and each deletion is accepted only after an exact re-check that the diameter is still 4, then new vertices are added one at a time by exact CP-SAT, each joined only to freed vertices, none joined to each other. After 417 deletions and 55 new vertices, the final graph has 8255 nodes and 57747 edges, maximum degree 14, and diameter 4, average degree 13.99 , degree histogram [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 72, 8181] and avg. dist.: 3.736110 .

Download the edge list of the graph.

This SageMath script computes several properties of the graph. This is the online version .

Former result, order=8200

Q₉(T₅); J. Gomez, M.A. Fiol. Dense Compound Graphs.Ars Combinatoria, 20-A (1985), pp. 211-237. link to the paper

Download the edges list of the graph (thanks to Petrit Isufi).

Dhar_15552

Degree = 15, Diameter = 4; Order =15552; Moore bound = 44326.

Dharunish Yugeswardeenoo (dharyugi@gmail.com; October 27, 2026). Results obtained by using a hybrid discovery framework in development: LLM-guided search over classical algebraic constructions, combined with local search and exact completion. The specific LLMs used were OpenAI's Sol 5.6 and Anthropic's Claude Fable 5 Max.

This graph is constructed as a polarity quotient of a bipartite route-chart lift over the group G = SmallGroup(336,20) ≅ C₇ ⋊ (C₃ × QD₁₆). The group has an index-2 subgroup, with the other coset containing the odd elements. The controller uses generators a, a^-1, b, b^-1 and c, where a and b are odd elements of order greater than 2 and c is an odd involution. The lift B has vertices (h,x), with h ∈ G and x ∈ F₃⁴. For each generator t, the edges join (h,x) to (ht, A_tx + λb_t), where λ ∈ F₃, A_t^-1 = A_t^-1, b_t^-1 = A_t^-1b_t, A_c² = I, and A_cb_c = b_c. The resulting bipartite lift is 15-regular, has 336·81 = 27216 vertices, and diameter 5. An odd involution c₀ defines a fixed-point-free automorphism ρ(h,x) = (c₀h,x), exchanging the two bipartition classes. Identifying each pair of vertices {u,ρ(u)} produces the quotient graph, where two classes are adjacent whenever their representatives are adjacent in B. The quotient has 13608 vertices and diameter 4, with 54 vertices of degree 14 and the remaining 13554 vertices of degree 15.

In this link (doi:10.5281/zenodo.23691325) you can download the adjacency list and the details of the construction of the graph.

Download the local raw adjacency list of the graph.

This SageMath script computes several properties of the graphs including symmetry group sizes and the number of k-cycles (k=3..). This is the online version .

Former result, order=13608

Obtained by Francesc Comellas (October 24, 2026), with the help of OpenAI GPT 6 Astra.

Graph constructed using a lift over F₃⁴ of a 168-vertex controller derived from the semidirect product G = Z₆ ⋉₁₁ Z₅₆, of order 336. As in the original contributions from M.J. Dinneen and P. Hafner (see top of this page), the group operation is defined by [a,b] × [u,v] = [(a+u) mod 6, (b·11^u+v) mod 56]. The controller is obtained using the group generators (5,0), (5,51), and (3,14), together with a polarity defined by the multiplier (3,0). Each controller vertex u is replaced by a fibre containing 3⁴ = 81 vertices (u,p), where p belongs to F₃⁴. For each oriented controller edge u → w, the lifted edges are determined by affine maps over F₃ of the form (u,p) ∼ (w,A_kp + λb_k), where λ ∈ F₃, and A_k and b_k are the specified 4×4 matrices and four-dimensional vectors associated with the three generator types. Additional edges within selected fibres complete the construction while keeping the maximum degree at 15. The resulting graph has 168·81 = 13608 vertices, 101493 edges, and diameter 4. It is not regular: 12474 vertices have degree 15 and the remaining 1134 vertices have degree 14. This construction improves the previous value of 13365 vertices by 243 vertices.

Download the local edge list of this graph.

This SageMath script computes several properties of the graphs. This is the online version .

Former result, order=13365

Mike McCormick ?? calgulbenkian ( ?? ; October 20, 2026), with Claude ?.

Information on the graph construction is available at this link.

Download the local edge list of the graph.

This SageMath script computes several properties of the graphs including symmetry group sizes and the number of k-cycles (k=3..). This is the online version .

Former result, order=11785

Q₁₁(T₄)+ Dharunish Yugeswardeenoo (dharyugi@gmail.com; Chalfont, PA, USA; October 7, 2026). Results obtained by using a hybrid discovery framework in development: LLM-guided search over classical algebraic constructions, combined with local search and exact completion. The specific LLMs used were OpenAI's Sol 5.6 and Anthropic's Claude Fable 5 Max.

Built on R. Rajiv's (15,4) construction (Zenodo 10.5281/zenodo.23052995): four copies of the incidence graph of the symplectic generalized quadrangle W(11), 2,928 vertices each, joined by index-aligned matchings, with the point-point matchings cut at a partial ovoid of W(11) and the line-line matchings at a line spread. All of his parameters are used unchanged except the point cut set: in place of a 68-point partial ovoid I use one with 72 points, which leaves more free slots. 72 new vertices are then attached, each taking one cut point together with spread lines in two of the blocks -- 9 of them with three lines per block, joined in a 9-cycle, and 63 with two lines per block and a 4-regular graph among themselves -- and one further vertex uses no cut point at all. 4 x 2,928 + 73 = 11,785 vertices, maximum degree 15, diameter 4. The 72 points of the partial ovoid are listed here: 1043 1093 1284 300 1035 905 837 736 957 1438 938 1157 417 1274 1193 149 1352 154 1414 292 1263 742 104 1132 125 1031 1219 236 1156 1330 241 536 733 929 985 1070 925 279 96 97 757 1023 160 766 750 821 523 1442 1019 718 1096 63 105 1228 225 1173 571 939 1138 1452 962 135 443 312 446 1029 433 801 252 201 695 857

Download the raw adjacency list of the graph.

Former result, order=11780

Q₁₁(T₄)+ Obtained by Rishabh Rajiv (rishabh.rajiv@alumni.ubc.ca, Septembert 30, 2026) with the use of AI agentic coding systems Anthropic's Claude Fable 5.1 and Opus 5.5. Modification of a previous entry.

In this link: https://doi.org/10.5281/zenodo.23052995 you can download the details and a paper describing the construction of the graph.

This SageMath script computes several properties of the graphs including symmetry group sizes and the number of k-cycles (k=3.). This is the online version .

Former result, order=11759

Obtained from P. Isufi's 11736-vertex graph Q11(T4)+ (below): eight of its vertices and 59 other edges are deleted, 13 new edges are added between original vertices, and 31 new vertices are added, joined to original vertices (374 edges) and to each other (43 edges). 251 vertices have degree 14. Degree histogram:

Download the raw adjacency list of the graph.

This SageMath script computes several properties of the graphs including symmetry group sizes and the number of k-cycles (k=3..). This is the online version .

Former result, order=11736

Graph constructed with the help of AI tools by Petrit Isufi (isufi.petrit@proton.me; Wuppertal, Germany. August 19, 2026).

After constructing Q₁₁(T₄) based on the published details (see below), as the graph is regular, no new vertices can be added without increasing the degrees. Edges are deleted and each deletion is accepted only after an exact re-check that the diameter is still 4, then new vertices are added one at a time by exact CP-SAT, each joined only to freed vertices, none joined to each other. After 382 deletions and 24 new vertices, the final graph has 11736 nodes and 87814 edges, maximum degree 15, and diameter 4, average degree 14.965 , degree histogram [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 410, 11325] and avg. dist.: 3.748630 .

Download the edge list of the graph.

Former result

(15,4)=11712. Q₁₁(T₄); J. Gomez, M.A. Fiol. Dense Compound Graphs.Ars Combinatoria, 20-A (1985), pp. 211-237. link to the paper

URSA_16384

Degree = 16, Diameter = 4; Order =16384; Moore bound=57857.

Ccmmunicated Sep 18, 2026 (contact: lmonroe@lanl.gov). Graph-lift construction found using the agentic tool URSA ( https://lanl.github.io/ursa LA-UR-26-28353) by J. Amarel, N. DeBardeleben, M. Grosskopf, V. Job, E. Lawrence, L. Monroe and R Somasundaram (LANL)

Download the raw adjacency list of the graph.

This SageMath script computes several properties of the graphs including symmetry group sizes and the number of k-cycles (k=3..). This is the online version (it may not run correctly as the graph is large).

Former result Q₁₁(T₅)+, order=14707

Obtained from P. Isufi's 14687-vertex graph Q11(T5)+ (below): five of its vertices and 136 other edges are deleted, and 25 new vertices are added, joined to original vertices (339 edges) and to each other (21 edges); no edges are added between original vertices. 75 vertices have degree below 16 (122 free slots). Degree histogram:

Download the raw adjacency list of the graph.

This SageMath script computes several properties of the graphs including symmetry group sizes and the number of k-cycles (k=3..). This is the online version .

Former result, order=14687

Graph constructed with the help of AI tools by Petrit Isufi (isufi.petrit@proton.me; Wuppertal, Germany. August 19, 2026).

After constructing Q₁₁(T₅) based on the published details (see below), as the graph is regular, no new vertices can be added without increasing the degrees. Edges are deleted and each deletion is accepted only after an exact re-check that the diameter is still 4, then new vertices are added one at a time by exact CP-SAT, each joined only to freed vertices, none joined to each other. After 400 deletions and 47 new vertices, the final graph has 14687 nodes and 117451 edges, maximum degree 16, and diameter 4, average degree 15.994, degree histogram [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 5, 75, 14606] and avg. dist.: 3.770451.

Download the edge list of the graph.

Former result

(16,4)=14640. Q₁₁(T₅); J. Gomez, M.A. Fiol. Dense Compound Graphs.Ars Combinatoria, 20-A (1985), pp. 211-237. link to the paper