A243323
Number of simple connected graphs with n nodes that are bipartite and not integral.
Original entry on oeis.org
0, 0, 1, 2, 4, 14, 43, 179, 730, 4019
Offset: 1
A243328
Number of simple connected graphs with n nodes that are integral and bipartite.
Original entry on oeis.org
1, 1, 0, 1, 1, 3, 1, 3, 0, 13
Offset: 1
A243545
Number of simple connected graphs with n nodes that are Hamiltonian and have no subgraph isomorphic to the bowtie graph.
Original entry on oeis.org
1, 0, 1, 3, 3, 14, 50, 390, 3627, 52858, 1045177
Offset: 1
A243553
Number of simple connected graphs with n nodes that are Hamiltonian and have no subgraph isomorphic to bull graph.
Original entry on oeis.org
1, 0, 1, 3, 1, 4, 5, 35, 130, 1293, 13529
Offset: 1
A243560
Number of simple connected graphs with n nodes that are Hamiltonian and have no subgraph isomorphic to diamond graph.
Original entry on oeis.org
1, 0, 1, 1, 2, 9, 27, 190, 1750, 25658, 531204
Offset: 1
A243790
Number of simple connected graphs with n nodes that are Hamiltonian and have no subgraph isomorphic to the open-bowtie graph.
Original entry on oeis.org
1, 0, 1, 3, 3, 9, 13, 59, 203, 1651, 15728
Offset: 1
A243796
Number of graphs with n nodes that are chordal and Hamiltonian.
Original entry on oeis.org
1, 0, 1, 2, 4, 15, 58, 360, 2793, 28761, 369545, 5914974, 116089531, 2816695796
Offset: 1
- Ammon Hepworth, Philip Nelson, and Raul Ramirez, Hamiltonian Cycles
- Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs
- T. Hoppe and A. Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644 [math.CO], 2014.
- F. Hüffner, tinygraph, software for generating integer sequences based on graph properties, version a1db88e
- Brendan McKay's Nauty Software and Algorithms, nauty and Traces
A264684
Number of simple Hamiltonian graphs on n nodes which do not satisfy the Ore criterion for Hamiltonicity.
Original entry on oeis.org
0, 0, 0, 0, 3, 27, 315, 5693, 172141, 9176757
Offset: 1
- Eric Weisstein's World of Mathematics, Ore Graph
Cf.
A264683 (number of simple graphs which satisfy the Ore criterion for Hamiltonicity).
Cf.
A003216 (number of simple Hamiltonian graphs).
A283825
Number of Hamiltonian regular graphs on n nodes.
Original entry on oeis.org
1, 0, 1, 2, 2, 5, 4, 17, 22, 165, 538, 18972, 389426, 50314715
Offset: 1
- F. Hüffner, tinygraph, software for generating integer sequences based on graph properties.
- Peter Steinbach, Field Guide to Simple Graphs, Volume 1, Part 17 (For Volumes 1, 2, 3, 4 of this book see A000088, A008406, A000055, A000664, respectively.)
- Eric Weisstein's World of Mathematics, Hamiltonian Graph
- Eric Weisstein's World of Mathematics, LCF Notation
- Eric Weisstein's World of Mathematics, Regular Graph
a(11)-a(14) added using tinygraph by
Falk Hüffner, Mar 31 2017
Comments