Identifier
-
Mp00184:
Integer compositions
—to threshold graph⟶
Graphs
St001335: Graphs ⟶ ℤ
Values
[1] => ([],1) => 0
[1,1] => ([(0,1)],2) => 0
[2] => ([],2) => 0
[1,1,1] => ([(0,1),(0,2),(1,2)],3) => 1
[1,2] => ([(1,2)],3) => 0
[2,1] => ([(0,2),(1,2)],3) => 0
[3] => ([],3) => 0
[1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 1
[1,1,2] => ([(1,2),(1,3),(2,3)],4) => 1
[1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4) => 1
[1,3] => ([(2,3)],4) => 0
[2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 1
[2,2] => ([(1,3),(2,3)],4) => 0
[3,1] => ([(0,3),(1,3),(2,3)],4) => 0
[4] => ([],4) => 0
[1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 1
[1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 1
[1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 1
[1,1,3] => ([(2,3),(2,4),(3,4)],5) => 1
[1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 1
[1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5) => 1
[1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5) => 1
[1,4] => ([(3,4)],5) => 0
[2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 1
[2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 1
[2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 1
[2,3] => ([(2,4),(3,4)],5) => 0
[3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 1
[3,2] => ([(1,4),(2,4),(3,4)],5) => 0
[4,1] => ([(0,4),(1,4),(2,4),(3,4)],5) => 0
[5] => ([],5) => 0
[1,1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[1,1,1,1,2] => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[1,1,1,2,1] => ([(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[1,1,1,3] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[1,1,2,1,1] => ([(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[1,1,2,2] => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[1,1,3,1] => ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[1,1,4] => ([(3,4),(3,5),(4,5)],6) => 1
[1,2,1,1,1] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[1,2,1,2] => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[1,2,2,1] => ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[1,2,3] => ([(2,5),(3,4),(3,5),(4,5)],6) => 1
[1,3,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[1,3,2] => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6) => 1
[1,4,1] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6) => 1
[1,5] => ([(4,5)],6) => 0
[2,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[2,1,1,2] => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[2,1,2,1] => ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[2,1,3] => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[2,2,1,1] => ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[2,4] => ([(3,5),(4,5)],6) => 0
[3,1,1,1] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[3,1,2] => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[3,3] => ([(2,5),(3,5),(4,5)],6) => 0
[4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[4,2] => ([(1,5),(2,5),(3,5),(4,5)],6) => 0
[5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6) => 0
[6] => ([],6) => 0
[1,1,1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,1,1,1,1,2] => ([(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,1,1,1,2,1] => ([(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,1,1,1,3] => ([(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,1,1,2,1,1] => ([(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,1,1,2,2] => ([(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,1,1,3,1] => ([(0,6),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,1,1,4] => ([(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,1,2,1,1,1] => ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,1,2,1,2] => ([(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,1,2,2,1] => ([(0,6),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,1,2,3] => ([(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,1,3,1,1] => ([(0,5),(0,6),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,1,3,2] => ([(1,6),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,1,4,1] => ([(0,6),(1,6),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,1,5] => ([(4,5),(4,6),(5,6)],7) => 1
[1,2,1,1,1,1] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,2,1,1,2] => ([(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,2,1,2,1] => ([(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,2,1,3] => ([(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,2,2,1,1] => ([(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,2,2,2] => ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,2,3,1] => ([(0,6),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,2,4] => ([(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,3,1,1,1] => ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,3,1,2] => ([(1,5),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,3,2,1] => ([(0,6),(1,5),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,3,3] => ([(2,6),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,4,1,1] => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,4,2] => ([(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,5,1] => ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,6] => ([(5,6)],7) => 0
[2,1,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[2,1,1,1,2] => ([(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[2,1,1,2,1] => ([(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[2,1,1,3] => ([(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[2,1,2,1,1] => ([(0,5),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[2,1,2,2] => ([(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
>>> Load all 194 entries. <<<
search for individual values
searching the database for the individual values of this statistic
/
search for generating function
searching the database for statistics with the same generating function
Description
The cardinality of a minimal cycle-isolating set of a graph.
Let $\mathcal F$ be a set of graphs. A set of vertices $S$ is $\mathcal F$-isolating, if the subgraph induced by the vertices in the complement of the closed neighbourhood of $S$ does not contain any graph in $\mathcal F$.
This statistic returns the cardinality of the smallest isolating set when $\mathcal F$ contains all cycles.
Let $\mathcal F$ be a set of graphs. A set of vertices $S$ is $\mathcal F$-isolating, if the subgraph induced by the vertices in the complement of the closed neighbourhood of $S$ does not contain any graph in $\mathcal F$.
This statistic returns the cardinality of the smallest isolating set when $\mathcal F$ contains all cycles.
Map
to threshold graph
Description
The threshold graph corresponding to the composition.
A threshold graph is a graph that can be obtained from the empty graph by adding successively isolated and dominating vertices.
A threshold graph is uniquely determined by its degree sequence.
The Laplacian spectrum of a threshold graph is integral. Interpreting it as an integer partition, it is the conjugate of the partition given by its degree sequence.
A threshold graph is a graph that can be obtained from the empty graph by adding successively isolated and dominating vertices.
A threshold graph is uniquely determined by its degree sequence.
The Laplacian spectrum of a threshold graph is integral. Interpreting it as an integer partition, it is the conjugate of the partition given by its degree sequence.
searching the database
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!