InducedDiamondCount on LabeledGraph
The sets of four vertices that induce a diamond: a cycle on four vertices with one chord, five edges.
FindStat's St001310. The only graph on four vertices with five edges is the diamond. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "InducedDiamondCount"). 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 St001310
The number of induced diamond graphs in 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/St001310 has the rest.