LargestInducedStarSize on LabeledGraph
The most vertices that induce a star: one vertex adjacent to all the others, which are not adjacent to each other. A single vertex is a star.
FindStat's St001674. A set is a star when it has one fewer edges than vertices and a vertex with all the others as neighbors. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "LargestInducedStarSize"). 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 St001674
The number of vertices of the largest induced star graph in the graph.
| Object | Value |
|---|---|
([],1) | 1 |
([],2) | 1 |
([],3) | 1 |
([],4) | 1 |
([],5) | 1 |
([],6) | 1 |
([],7) | 1 |
([(0,1)],2) | 2 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001674 has the rest.