GraphDifferential on LabeledGraph
The most that the vertices next to a set, outside it, exceed the set in number.
FindStat's St001723; the empty set gives 0. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "GraphDifferential"). 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 St001723
The differential of a graph.
| Object | Value |
|---|---|
([],1) | 0 |
([],2) | 0 |
([],3) | 0 |
([],4) | 0 |
([],5) | 0 |
([],6) | 0 |
([],7) | 0 |
([(0,1)],2) | 0 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001723 has the rest.