A244427 -id:A244427 - cp's OEIS frontend

A079575 Number of unlabeled, connected graphs on n vertices with no induced subgraph isomorphic to a bull-graph.

Original entry on oeis.org

1, 1, 2, 6, 20, 93, 480, 2960, 19475, 140851, 1116717, 10329833, 121557264

Offset: 1

Jim Nastos, Jan 24 2003

A bull-graph is formed by adding a 5th vertex to a 4-path adjacent only to the middle two vertices on the path.

C. De Simone and A. Sassano, Stability number of bull- and chair-free graphs, Discrete Appl. Math. 41 (1993) 121-129.
Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs
Falk Hüffner, tinygraph, software for generating integer sequences based on graph properties, version ece94ef.
Eric Weisstein's World of Mathematics, Bull Graph

Cf. A244427 (no bull subgraph).

a(10)-a(13) added using tinygraph by Falk Hüffner, Jan 15 2016

A243248 Number of unlabeled, connected graphs on n vertices with at least one subgraph isomorphic to a bull-graph.

Original entry on oeis.org

0, 0, 0, 0, 12, 86, 773, 10777, 259390, 11705139

Offset: 1

Travis Hoppe and Anna Petrone, Jun 01 2014

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
Eric Weisstein's World of Mathematics, Bull Graph

Cf. A244427 (no bull subgraphs).

a(n) = A001349(n) - A244427(n).

A243552 Number of simple connected graphs with n nodes that have no subgraph isomorphic to the bowtie graph or bull graph.

Original entry on oeis.org

1, 1, 2, 6, 8, 25, 77, 333, 1668, 11355

Offset: 1

Travis Hoppe and Anna Petrone, Jun 06 2014

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, 2014

Cf. A242792 (no bowtie subgraphs), A244427 (no bull subgraphs).

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

Travis Hoppe and Anna Petrone, Jun 06 2014

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

Cf. A244427 (no bull subgraphs), A003216 (Hamiltonian graphs).

a(11) added using tinygraph by Falk Hüffner, Aug 15 2017

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

Travis Hoppe and Anna Petrone, Jun 06 2014

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, 2014

Cf. A244427 (no bull subgraphs), A241814 (distance-regular graphs).

A243555 Number of simple connected graphs with n nodes that are Eulerian and have no subgraph isomorphic to bull graph.

Original entry on oeis.org

1, 0, 1, 1, 2, 3, 5, 14, 30, 95

Offset: 1

Travis Hoppe and Anna Petrone, Jun 06 2014

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, 2014

Cf. A244427 (no bull subgraphs), A003049 (Eulerian graphs).

A243556 Number of simple connected graphs with n nodes that are integral and have no subgraph isomorphic to bull graph.

Original entry on oeis.org

1, 1, 1, 2, 1, 3, 2, 3, 0, 14

Offset: 1

Travis Hoppe and Anna Petrone, Jun 06 2014

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, 2014

Cf. A244427 (no bull subgraphs), A064731 (integral graphs).

A243557 Number of simple connected graphs with n nodes that are non-integral and have no subgraph isomorphic to bull graph.

Original entry on oeis.org

0, 0, 1, 4, 8, 23, 78, 337, 1690, 11418

Offset: 1

Travis Hoppe and Anna Petrone, Jun 06 2014

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.

Cf. A244427 (no-bull subgraphs), A241842 (non-integral graphs).

A243558 Number of simple connected graphs with n nodes that are planar and have no subgraph isomorphic to bull graph.

Original entry on oeis.org

1, 1, 2, 6, 9, 25, 76, 302, 1360, 7606, 49313, 368568, 3046968

Offset: 1

Travis Hoppe and Anna Petrone, Jun 06 2014

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, 2014
F. Hüffner, tinygraph, software for generating integer sequences based on graph properties, version 9766535.

Cf. A244427 (no bull subgraphs), A003094 (planar graphs).

a(11)-a(13) added using tinygraph by Falk Hüffner, May 09 2019

A243559 Number of simple connected graphs with n nodes that have no subgraph isomorphic to bull graph or K_4.

Original entry on oeis.org

1, 1, 2, 5, 9, 26, 80, 340, 1690, 11432, 101142, 1228608, 20329150

Offset: 1

Travis Hoppe and Anna Petrone, Jun 06 2014

K_4 is the complete graph with four vertices.

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, 2014
F. Hüffner, tinygraph, software for generating integer sequences based on graph properties, version 29e68fa.

Cf. A244427 (no bull subgraphs), A079574 (K_4 free graphs).

a(11)-a(13) added using tinygraph by Falk Hüffner, Sep 23 2020

cp's OEIS Frontend

A079575 Number of unlabeled, connected graphs on n vertices with no induced subgraph isomorphic to a bull-graph.

Views

Author

Keywords

Comments

Links

Crossrefs

Extensions

A243248 Number of unlabeled, connected graphs on n vertices with at least one subgraph isomorphic to a bull-graph.

Views

Author

Keywords

Links

Crossrefs

Formula

A243552 Number of simple connected graphs with n nodes that have no subgraph isomorphic to the bowtie graph or bull graph.

Views

Author

Keywords

Links

Crossrefs

A243553 Number of simple connected graphs with n nodes that are Hamiltonian and have no subgraph isomorphic to bull graph.

Views

Author

Keywords

Links

Crossrefs

Extensions

A243554 Number of simple connected graphs with n nodes that are distance-regular and have no subgraph isomorphic to bull graph.

Views

Author

Keywords

Links

Crossrefs

A243555 Number of simple connected graphs with n nodes that are Eulerian and have no subgraph isomorphic to bull graph.

Views

Author

Keywords

Links

Crossrefs

A243556 Number of simple connected graphs with n nodes that are integral and have no subgraph isomorphic to bull graph.

Views

Author

Keywords

Links

Crossrefs

A243557 Number of simple connected graphs with n nodes that are non-integral and have no subgraph isomorphic to bull graph.

Views

Author

Keywords

Links

Crossrefs

A243558 Number of simple connected graphs with n nodes that are planar and have no subgraph isomorphic to bull graph.

Views

Author

Keywords

Links

Crossrefs

Extensions

A243559 Number of simple connected graphs with n nodes that have no subgraph isomorphic to bull graph or K_4.

Views

Author

Keywords

Comments

Links

Crossrefs

Extensions