SzegedIndex on LabeledGraph
The sum over the edges of the vertices nearer one end times those nearer the other.
FindStat's St000263. A vertex in another component is as far from both ends, so is in neither count. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "SzegedIndex"). 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 St000263
The Szeged index 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/St000263 has the rest.