

A296621


Number of 5regular (quintic) connected graphs on 2*n nodes with diameter k written as irregular triangle T(n,k).


2



1, 0, 3, 0, 60, 0, 5457, 2391, 0, 258474, 3200871, 37, 1, 0, 1041762, 2583730089, 364670, 154, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

3,3


COMMENTS

The results were found by applying the FloydWarshall algorithm to the output of Markus Meringer's GenReg program.


LINKS

M. Meringer, GenReg, Generation of regular graphs.


EXAMPLE

Triangle begins:
Diameter
n/ 1 2 3 4 5
6: 0 1
8: 0 3
10: 0 60
12: 0 5457 2391
14: 0 258474 3200871 37 1
16: 0 1041762 2583730089 364670 154
.
The adjacency matrix of the unique 5regular graph on 14 nodes with diameter 5 is provided as example in A296526.


CROSSREFS



KEYWORD

nonn,tabf,more


AUTHOR



STATUS

approved



