Identifier
Values
([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => 12
([(1,4),(1,5),(2,3),(2,5),(3,4)],6) => ([(1,4),(1,5),(2,3),(2,5),(3,4)],6) => ([(1,4),(1,5),(2,3),(2,5),(3,4)],6) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => 12
([(0,1),(0,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => 12
([(0,1),(0,5),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5)],6) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => 12
([(1,2),(1,3),(2,6),(3,5),(4,5),(4,6),(5,6)],7) => ([(1,4),(1,5),(2,3),(2,5),(3,4)],6) => ([(1,4),(1,5),(2,3),(2,5),(3,4)],6) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => 12
([(0,1),(0,2),(1,6),(2,5),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => ([(0,1),(0,5),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5)],6) => ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => 12
([(0,1),(2,5),(2,6),(3,4),(3,6),(4,5)],7) => ([(1,4),(1,5),(2,3),(2,5),(3,4)],6) => ([(1,4),(1,5),(2,3),(2,5),(3,4)],6) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => 12
([(0,1),(0,5),(1,4),(2,4),(2,6),(3,5),(3,6),(4,6),(5,6)],7) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => 12
([(1,2),(1,6),(2,5),(3,4),(3,5),(3,6),(4,5),(4,6)],7) => ([(1,4),(1,5),(2,3),(2,5),(3,4)],6) => ([(1,4),(1,5),(2,3),(2,5),(3,4)],6) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => 12
([(0,4),(0,6),(1,3),(1,5),(2,5),(2,6),(3,4),(3,5),(4,6)],7) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => 12
([(0,4),(0,5),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,6),(5,6)],7) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => 12
([(0,1),(0,2),(1,6),(2,5),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => 12
([(0,5),(0,6),(1,2),(1,5),(2,3),(3,4),(3,6),(4,5),(4,6),(5,6)],7) => ([(0,1),(0,5),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5)],6) => ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => 12
([(0,1),(0,5),(1,4),(2,4),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => ([(0,3),(0,4),(1,2),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6) => ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => 12
([(0,5),(0,6),(1,3),(1,6),(2,3),(2,4),(2,5),(3,4),(4,5),(4,6),(5,6)],7) => ([(0,3),(0,4),(1,2),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6) => ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => 12
([(0,3),(0,4),(1,4),(1,5),(1,6),(2,3),(2,5),(2,6),(3,5),(4,6),(5,6)],7) => ([(0,1),(0,5),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5)],6) => ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => 12
([(0,1),(0,6),(1,3),(2,4),(2,5),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => 12
([(0,5),(0,6),(1,2),(1,3),(1,4),(2,3),(2,4),(3,6),(4,5),(5,6)],7) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => 12
([(0,1),(0,4),(0,5),(1,2),(1,3),(2,3),(2,6),(3,6),(4,5),(4,6),(5,6)],7) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => 12
([(0,1),(0,2),(1,5),(1,6),(2,3),(2,4),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => 12
([(0,1),(0,3),(0,5),(1,2),(1,4),(2,4),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => ([(0,3),(0,4),(1,2),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6) => ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => 12
([(0,1),(0,6),(1,5),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6)],7) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => 12
search for individual values
searching the database for the individual values of this statistic
Description
The toughness times the least common multiple of 1,...,n-1 of a non-complete graph.
A graph $G$ is $t$-tough if $G$ cannot be split into $k$ different connected components by the removal of fewer than $tk$ vertices for all integers $k>1$.
The toughness of $G$ is the maximal number $t$ such that $G$ is $t$-tough. It is a rational number except for the complete graph, where it is infinity. The toughness of a disconnected graph is zero.
This statistic is the toughness multiplied by the least common multiple of $1,\dots,n-1$, where $n$ is the number of vertices of $G$.
A graph $G$ is $t$-tough if $G$ cannot be split into $k$ different connected components by the removal of fewer than $tk$ vertices for all integers $k>1$.
The toughness of $G$ is the maximal number $t$ such that $G$ is $t$-tough. It is a rational number except for the complete graph, where it is infinity. The toughness of a disconnected graph is zero.
This statistic is the toughness multiplied by the least common multiple of $1,\dots,n-1$, where $n$ is the number of vertices of $G$.
Map
connected complement
Description
The componentwise connected complement of a graph.
For a connected graph $G$, this map returns the complement of $G$ if it is connected, otherwise $G$ itself. If $G$ is not connected, the map is applied to each connected component separately.
For a connected graph $G$, this map returns the complement of $G$ if it is connected, otherwise $G$ itself. If $G$ is not connected, the map is applied to each connected component separately.
Map
clique graph
Description
The clique graph of a graph.
The clique graph of a graph $G$ has as vertex set the set of maximal cliques $G$ and an edge between vertices corresponding to cliques that intersect.
In other words, it is the intersection graph of the maximal cliques of $G$.
The clique graph of a graph $G$ has as vertex set the set of maximal cliques $G$ and an edge between vertices corresponding to cliques that intersect.
In other words, it is the intersection graph of the maximal cliques of $G$.
Map
core
Description
The core of a graph.
The core of a graph $G$ is the smallest graph $C$ such that there is a homomorphism from $G$ to $C$ and a homomorphism from $C$ to $G$.
Note that the core of a graph is not necessarily connected, see [2].
The core of a graph $G$ is the smallest graph $C$ such that there is a homomorphism from $G$ to $C$ and a homomorphism from $C$ to $G$.
Note that the core of a graph is not necessarily connected, see [2].
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!