DistinctNeighborhoodCount on LabeledGraph
The different sets of neighbors the vertices have.
FindStat's St000722: the vertices whose row of the adjacency matrix has no equal row above it. Two adjacent vertices never share a neighborhood. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "DistinctNeighborhoodCount"). 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 St000722
The number of different neighbourhoods in a graph.
| Object | Value |
|---|---|
([],1) | 1 |
([],2) | 1 |
([],3) | 1 |
([],4) | 1 |
([],5) | 1 |
([],6) | 1 |
([],7) | 1 |
([(0,1)],2) | 2 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St000722 has the rest.