AlbertsonIndex on LabeledGraph
The sum over the edges of the difference of the degrees of its ends.
FindStat's St001351, the sum of |d(u) - d(v)| over the edges uv. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "AlbertsonIndex"). 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 St001351
The Albertson index 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/St001351 has the rest.