SchultzIndex on LabeledGraph
The sum over the pairs of vertices of the sum of their degrees times their distance.
FindStat's St000464, of a connected graph; a pair with no path adds nothing. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "SchultzIndex"). 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 St000464
The Schultz index of a connected graph.
| Object | Value |
|---|---|
([(0,1)],2) | 2 |
([(0,2),(1,2)],3) | 10 |
([(0,1),(0,2),(1,2)],3) | 12 |
([(0,3),(1,2),(2,3)],4) | 28 |
([(0,3),(1,3),(2,3)],4) | 24 |
([(0,2),(0,3),(1,2),(1,3)],4) | 32 |
([(0,3),(1,2),(1,3),(2,3)],4) | 30 |
([(0,4),(1,3),(2,3),(2,4)],5) | 60 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St000464 has the rest.