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

0, 0, 0, 5, 20, 16, 22, 29, 37, 46

Offset

1,4

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

Table of n, a(n) for n=1..10.

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

Eric Weisstein's World of Mathematics, Matching Number

Eric Weisstein's World of Mathematics, Maximum Independent Edge Set

Crossrefs

Column k=2 of A325304.

Cf. A243801 (max size of independent edge set=3).

Sequence in context: A357908 A030696 A227109 * A335555 A098047 A231276

Adjacent sequences: A243797 A243798 A243799 * A243801 A243802 A243803

Keyword

nonn,more

Author

Travis Hoppe and Anna Petrone, Jul 15 2014

Status

approved