

A243801


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


2




OFFSET

1,6


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

Cf. A243800 (max size of independent edge set=2).


KEYWORD

nonn,more


AUTHOR



STATUS

approved



