HalfTotalIrregularity on LabeledGraph
Half the sum over the unordered pairs of vertices of the difference of their degrees.
FindStat's St001521. Four times it is the sum over the ordered pairs. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "HalfTotalIrregularity"). 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 St001521
Half the total irregularity 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/St001521 has the rest.