A241840
Number of simple connected graphs on n nodes that are not distance-regular.
Original entry on oeis.org
0, 0, 1, 4, 19, 108, 851, 11112, 261076, 11716564
Offset: 1
A243271
Number of unlabeled simple graphs with n nodes that are Hamiltonian and distance-regular.
Original entry on oeis.org
1, 0, 1, 2, 2, 4, 2, 5, 4, 6
Offset: 1
A243319
Number of simple connected graphs with n nodes that are bipartite and distance regular.
Original entry on oeis.org
1, 1, 0, 1, 0, 2, 0, 3, 0, 3
Offset: 1
A243322
Number of simple connected graphs with n nodes that are distance regular and Eulerian.
Original entry on oeis.org
1, 0, 1, 1, 2, 2, 2, 3, 4, 4
Offset: 1
A243329
Number of simple connected graphs with n nodes that are integral and distance regular.
Original entry on oeis.org
1, 1, 1, 2, 1, 4, 1, 4, 3, 6
Offset: 1
A243334
Number of simple connected graphs with n nodes that are distance regular and triangle-free.
Original entry on oeis.org
1, 1, 0, 1, 1, 2, 1, 3, 1, 4, 1, 3, 1, 5, 1, 5, 1, 4
Offset: 1
Cf.
A241814 (distance regular graphs),
A024607 (triangle-free graphs).
A243339
Number of simple connected graphs with n nodes that are distance regular and K_4 free.
Original entry on oeis.org
1, 1, 1, 1, 1, 3, 1, 3, 3, 4
Offset: 1
A243546
Number of simple connected graphs with n nodes that are distance regular and have no subgraph isomorphic to the bowtie graph.
Original entry on oeis.org
1, 1, 1, 2, 1, 2, 1, 3, 1, 4
Offset: 1
A243554
Number of simple connected graphs with n nodes that are distance-regular and have no subgraph isomorphic to bull graph.
Original entry on oeis.org
1, 1, 1, 2, 1, 2, 1, 3, 1, 4
Offset: 1
A243561
Number of simple connected graphs with n nodes that are distance regular and have no subgraph isomorphic to diamond graph.
Original entry on oeis.org
1, 1, 1, 1, 1, 2, 1, 3, 2, 4
Offset: 1
Showing 1-10 of 10 results.
Comments