%I #14 Sep 06 2019 11:16:17
%S 0,0,0,0,0,95,830,790,1479,2625
%N Number of simple connected graphs on n nodes whose maximum size of an independent edge set is equal to 3.
%C 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.
%C The maximum size of an independent edge set is also called the matching number of the graph. - _Andrew Howroyd_, Sep 05 2019
%H Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>
%H T. Hoppe and A. Petrone, <a href="http://arxiv.org/abs/1408.3644">Integer sequence discovery from small graphs</a>, arXiv preprint arXiv:1408.3644, 2014
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MatchingNumber.html">Matching Number</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MaximumIndependentEdgeSet.html">Maximum Independent Edge Set</a>
%Y Column k=2 of A325304.
%Y Cf. A243800 (max size of independent edge set=2).
%K nonn,more
%O 1,6
%A _Travis Hoppe_ and _Anna Petrone_, Jul 15 2014