Identifier
Values
([],3) => ([],3) => ([(0,1),(0,2),(1,2)],3) => ([(0,1),(0,2),(1,2)],3) => 3
([],4) => ([],4) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 3
([(2,3)],4) => ([(2,3)],4) => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => ([(0,1),(0,2),(1,2)],3) => 3
([],5) => ([],5) => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 3
([(3,4)],5) => ([(3,4)],5) => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 3
([(2,4),(3,4)],5) => ([(2,3),(2,4),(3,4)],5) => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => ([(0,1),(0,2),(1,2)],3) => 3
([(1,4),(2,3)],5) => ([(1,4),(2,3)],5) => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5) => ([(0,1),(0,2),(1,2)],3) => 3
([(1,4),(2,3),(3,4)],5) => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5) => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5) => ([(0,1),(0,2),(1,2)],3) => 3
([(2,3),(2,4),(3,4)],5) => ([(2,3),(2,4),(3,4)],5) => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => ([(0,1),(0,2),(1,2)],3) => 3
([],6) => ([],6) => ([(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) => ([(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) => 2
([(4,5)],6) => ([(4,5)],6) => ([(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) => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 3
([(3,5),(4,5)],6) => ([(3,4),(3,5),(4,5)],6) => ([(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) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 3
([(2,5),(3,5),(4,5)],6) => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => 3
([(2,5),(3,4)],6) => ([(2,5),(3,4)],6) => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 3
([(2,5),(3,4),(4,5)],6) => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 3
([(1,2),(3,5),(4,5)],6) => ([(1,2),(3,4),(3,5),(4,5)],6) => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => 3
([(3,4),(3,5),(4,5)],6) => ([(3,4),(3,5),(4,5)],6) => ([(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) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 3
([(1,5),(2,5),(3,4),(4,5)],6) => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => 3
([(2,5),(3,4),(3,5),(4,5)],6) => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => 3
([(2,4),(2,5),(3,4),(3,5)],6) => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => 3
([(1,5),(2,3),(2,4),(3,5),(4,5)],6) => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => 3
([(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => 3
([(1,5),(2,4),(3,4),(3,5),(4,5)],6) => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => 3
([(0,5),(1,4),(2,3)],6) => ([(0,5),(1,4),(2,3)],6) => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6) => ([(0,1),(0,2),(1,2)],3) => 3
([(1,5),(2,4),(3,4),(3,5)],6) => ([(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => 3
([(0,1),(2,5),(3,4),(4,5)],6) => ([(0,1),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6) => ([(0,1),(0,2),(1,2)],3) => 3
([(1,2),(3,4),(3,5),(4,5)],6) => ([(1,2),(3,4),(3,5),(4,5)],6) => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => 3
([(0,5),(1,4),(2,3),(3,5),(4,5)],6) => ([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(1,5),(2,4),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => 3
([(1,4),(2,3),(2,5),(3,5),(4,5)],6) => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => 3
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6) => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => 3
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6) => ([(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) => ([(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => 3
([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => 3
search for individual values
searching the database for the individual values of this statistic
Description
The distinguishing index of a graph.
This is the smallest number of colours such that there is a colouring of the edges which is not preserved by any automorphism.
If the graph has a connected component which is a single edge, or at least two isolated vertices, this statistic is undefined.
This is the smallest number of colours such that there is a colouring of the edges which is not preserved by any automorphism.
If the graph has a connected component which is a single edge, or at least two isolated vertices, this statistic is undefined.
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].
Map
square
Description
The square of a graph.
For a graph G, the square is the graph on the same set of vertices where two vertices are joined by an edge if there is a path in G of length at most two between the two.
In other words, a vertex gets joint to its 2-neighbourhood in G.
For a graph G, the square is the graph on the same set of vertices where two vertices are joined by an edge if there is a path in G of length at most two between the two.
In other words, a vertex gets joint to its 2-neighbourhood in G.
Map
complement
Description
The complement of a graph.
The complement of a graph has the same vertices, but exactly those edges that are not in the original graph.
The complement of a graph has the same vertices, but exactly those edges that are not in the original graph.
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!