A243801 - OEIS

A243801

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

0, 0, 0, 0, 0, 95, 830, 790, 1479, 2625

(list; graph; refs; listen; history; text; internal format)

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

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. A243800 (max size of independent edge set=2).

Sequence in context: A362322 A020322 A055829 * A372187 A093295 A060484

Adjacent sequences: A243798 A243799 A243800 * A243802 A243803 A243804

KEYWORD

nonn,more

AUTHOR

Travis Hoppe and Anna Petrone, Jul 15 2014

STATUS

approved