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-2 of 2 results.

A243800 Number of simple connected graphs on n nodes whose maximum size of an independent edge set is equal to 2.

Original entry on oeis.org

0, 0, 0, 5, 20, 16, 22, 29, 37, 46
Offset: 1

Views

Author

Travis Hoppe and Anna Petrone, Jul 15 2014

Keywords

Comments

An independent edge set is a subset of the edges such that no two edges in the subset share a vertex. A maximum independent edge set is an independent edge set containing the largest possible number of edges among all independent edge sets.
The maximum size of an independent edge set is also called the matching number of the graph. - Andrew Howroyd, Sep 05 2019

Links

Crossrefs

Column k=2 of A325304.
Cf. A243801 (max size of independent edge set=3).

A243801 Number of simple connected graphs on n nodes whose maximum size of an independent edge set is equal to 3.

Original entry on oeis.org

0, 0, 0, 0, 0, 95, 830, 790, 1479, 2625
Offset: 1

Views

Author

Travis Hoppe and Anna Petrone, Jul 15 2014

Keywords

Comments

An independent edge set is a subset of the edges such that no two edges in the subset share a vertex. A maximum independent edge set an independent edge set containing the largest possible number of edges among all independent edge sets.
The maximum size of an independent edge set is also called the matching number of the graph. - Andrew Howroyd, Sep 05 2019

Links

Crossrefs

Column k=2 of A325304.
Cf. A243800 (max size of independent edge set=2).
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.