Identifier
Values
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5) => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5) => ([(2,3),(2,4),(3,4)],5) => ([(0,1),(0,2),(1,2)],3) => 3
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6) => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6) => ([(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
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6) => ([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6) => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => 3
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6) => ([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6) => ([(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => 3
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6) => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6) => ([(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => 3
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6) => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6) => ([(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => 3
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6) => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6) => ([(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.
Map
to poset
Description
Return the poset corresponding to the lattice.
Map
incomparability graph
Description
The incomparability graph of a poset.
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].