InducedMatchingNumber on LabeledGraph
The most edges whose ends induce a subgraph that is just those edges.
FindStat's St001393: half the vertices of the largest set in which every vertex has exactly one neighbor. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "InducedMatchingNumber"). The head's page has its examples.
Live
Distribution
Over LabeledGraphs at each size, tallied here in your browser; sizes past 6 are not offered.
FindStat St001393
The induced matching number of a graph.
| Object | Value |
|---|---|
([],1) | 0 |
([],2) | 0 |
([],3) | 0 |
([],4) | 0 |
([],5) | 0 |
([],6) | 0 |
([],7) | 0 |
([(0,1)],2) | 1 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001393 has the rest.