cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-9 of 9 results.

A243247 Number of unlabeled, connected graphs on n vertices with at least one subgraph isomorphic to an open-bowtie graph.

Original entry on oeis.org

0, 0, 0, 0, 10, 78, 755, 10709, 259123, 11703831, 1006591916, 164058548700, 50335887082115
Offset: 1

Views

Author

Travis Hoppe and Anna Petrone, Jun 01 2014

Keywords

Examples

			n=5: The ten simple (no loop) graphs satisfying the cricket (open bowtie) subgraph condition have vertex degrees: 4^5, 4^3 3^2, 4^2 3^2 2, 4^2 2^3, 4 3^4, 4 3^3 1, 4 3^2 2^2, 4 3 2^2 1, 4 2^4 (bowtie), 4 2^2 1^2 (cricket). - _Wolfdieter Lang_, Jun 08 2025
		

Formula

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

Extensions

a(11)-a(13) added using formula by Falk Hüffner, Jan 16 2016

A243789 Number of simple connected graphs with n nodes that have no subgraph isomorphic to the open-bowtie graph or the diamond graph.

Original entry on oeis.org

1, 1, 2, 4, 9, 30, 89, 379, 1864, 12365, 106951, 1272286, 20722347
Offset: 1

Views

Author

Travis Hoppe and Anna Petrone, Jun 16 2014

Keywords

Crossrefs

Cf. A242791 (open-bowtie free graphs), A242790 (diamond free graphs).

Extensions

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

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

Views

Author

Travis Hoppe and Anna Petrone, Jun 16 2014

Keywords

Crossrefs

Cf. A242791 (open-bowtie free graphs), A003216 (Hamiltonian graphs).

Extensions

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

A243791 Number of simple connected graphs with n nodes that are Eulerian and have no subgraph isomorphic to the open-bowtie graph.

Original entry on oeis.org

1, 0, 1, 1, 1, 2, 3, 8, 19, 62
Offset: 1

Views

Author

Travis Hoppe and Anna Petrone, Jun 16 2014

Keywords

Crossrefs

Cf. A242791 (open-bowtie free graphs), A003049 (Eulerian graphs).

A243792 Number of simple connected graphs with n nodes that are integral and have no subgraph isomorphic to the open-bowtie graph.

Original entry on oeis.org

1, 1, 1, 2, 1, 4, 1, 3, 0, 15
Offset: 1

Views

Author

Travis Hoppe and Anna Petrone, Jun 16 2014

Keywords

Crossrefs

Cf. A242791 (open-bowtie free graphs), A064731 (integral graphs).

A243793 Number of simple connected graphs with n nodes that are not integral and have no subgraph isomorphic to the open-bowtie graph.

Original entry on oeis.org

0, 0, 1, 4, 10, 30, 97, 405, 1957, 12725
Offset: 1

Views

Author

Travis Hoppe and Anna Petrone, Jun 16 2014

Keywords

Crossrefs

Cf. A242791 (open-bowtie-free graphs), A241842 (non-integral graphs).

A243794 Number of simple connected graphs with n nodes that are planar and have no subgraph isomorphic to the open-bowtie graph.

Original entry on oeis.org

1, 1, 2, 6, 11, 33, 94, 370, 1627, 8895, 56416, 414456, 3382661
Offset: 1

Views

Author

Travis Hoppe and Anna Petrone, Jun 16 2014

Keywords

Crossrefs

Cf. A242791 (open-bowtie free graphs), A003094 (planar graphs).

Extensions

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

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

Original entry on oeis.org

1, 1, 2, 6, 7, 22, 65, 285, 1442, 10106, 92277, 1153548, 19504515
Offset: 1

Views

Author

Travis Hoppe and Anna Petrone, Jun 16 2014

Keywords

Crossrefs

Cf. A242791 (no open-bowtie graphs), A244427 (no bull subgraphs).

Extensions

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

A243799 Number of connected graphs with n nodes that are chordal and are open-bowtie free.

Original entry on oeis.org

1, 1, 2, 5, 6, 13, 25, 58, 130, 316, 769, 1962, 5052, 13342, 35629, 96671
Offset: 1

Views

Author

Travis Hoppe and Anna Petrone, Jun 27 2014

Keywords

Comments

The open bowtie graph is also known as a cricket. - Falk Hüffner, Jul 01 2018

Crossrefs

Cf. A048192 (chordal graphs), A242791 (open-bowtie free graphs).

Extensions

Definition corrected (connected only) by Falk Hüffner, Jul 01 2018
a(11)-a(16) added using tinygraph by Falk Hüffner, Jul 01 2018
Showing 1-9 of 9 results.