MaximumLeafNeighborCount on LabeledGraph
The most neighbors of degree 1 a vertex has.
FindStat's St001826. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "MaximumLeafNeighborCount"). 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 St001826
The maximal number of leaves on a vertex 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/St001826 has the rest.