DistanceThreePairCount on LabeledGraph
The pairs of vertices at distance 3.
FindStat's St000447. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "DistanceThreePairCount"). 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 St000447
The number of pairs of vertices of a graph with distance 3.
| Object | Value |
|---|---|
([],1) | 0 |
([],2) | 0 |
([],3) | 0 |
([],4) | 0 |
([],5) | 0 |
([],6) | 0 |
([(0,1)],2) | 0 |
([(1,2)],3) | 0 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St000447 has the rest.