KingCount on LabeledGraph
The vertices whose neighbors all have a smaller degree; an isolated vertex counts.
FindStat's St001691. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "KingCount"). 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 St001691
The number of kings in a graph.
| Object | Value |
|---|---|
([],1) | 1 |
([],2) | 2 |
([],3) | 3 |
([],4) | 4 |
([],5) | 5 |
([],6) | 6 |
([],7) | 7 |
([(0,1)],2) | 0 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001691 has the rest.