Your data matches 7 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000311
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
St000311: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => ([],1)
 => ([],1)
 => 0
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(0,2),(1,2)],3)
 => 2
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => 4
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => 4
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => 4
Description
The number of vertices of odd degree in a graph.
Matching statistic: St000422
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
Mp00111: Graphs —complement⟶ Graphs
St000422: Graphs ⟶ ℤResult quality: 60% ●values known / values provided: 60%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => ([],1)
 => ([],1)
 => ([],1)
 => 0
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => 2
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => ([(1,2),(1,3),(2,3)],4)
 => 4
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
 => ? = 4
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1),(0,5),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ? = 4
Description
The energy of a graph, if it is integral. The energy of a graph is the sum of the absolute values of its eigenvalues. This statistic is only defined for graphs with integral energy. It is known, that the energy is never an odd integer [2]. In fact, it is never the square root of an odd integer [3]. The energy of a graph is the sum of the energies of the connected components of a graph. The energy of the complete graph $K_n$ equals $2n-2$. For this reason, we do not define the energy of the empty graph.
Matching statistic: St001574
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
Mp00203: Graphs —cone⟶ Graphs
St001574: Graphs ⟶ ℤResult quality: 60% ●values known / values provided: 60%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => ([],1)
 => ([],1)
 => ([(0,1)],2)
 => 0
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 2
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(2,3)],4)
 => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => 4
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => ([(4,5)],6)
 => ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7)
 => ? = 4
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,6),(1,2),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ? = 4
Description
The minimal number of edges to add or remove to make a graph regular.
Matching statistic: St001576
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
Mp00203: Graphs —cone⟶ Graphs
St001576: Graphs ⟶ ℤResult quality: 60% ●values known / values provided: 60%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => ([],1)
 => ([],1)
 => ([(0,1)],2)
 => 0
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 2
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(2,3)],4)
 => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => 4
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => ([(4,5)],6)
 => ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7)
 => ? = 4
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,6),(1,2),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ? = 4
Description
The minimal number of edges to add or remove to make a graph vertex transitive. A graph is vertex transitive if for any two edges there is an automorphism that maps one vertex to the other.
Matching statistic: St001703
(load all 2 compositions to match this statistic)
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
Mp00111: Graphs —complement⟶ Graphs
St001703: Graphs ⟶ ℤResult quality: 60% ●values known / values provided: 60%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => ([],1)
 => ([],1)
 => ([],1)
 => 0
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => ([(0,2),(1,2)],3)
 => 2
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],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)
 => ? = 4
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
 => ? = 4
Description
The villainy of a graph. The villainy of a permutation of a proper coloring $c$ of a graph is the minimal Hamming distance between $c$ and a proper coloring. The villainy of a graph is the maximal villainy of a permutation of a proper coloring.
Matching statistic: St000264
(load all 2 compositions to match this statistic)
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
Mp00111: Graphs —complement⟶ Graphs
St000264: Graphs ⟶ ℤResult quality: 33% ●values known / values provided: 60%●distinct values known / distinct values provided: 33%
Values
['A',1]
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 0 - 1
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => ? = 2 - 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => ([(1,2),(1,3),(2,3)],4)
 => 3 = 4 - 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
 => 3 = 4 - 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1),(0,5),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 3 = 4 - 1
Description
The girth of a graph, which is not a tree. This is the length of the shortest cycle in the graph.
Matching statistic: St001878
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00125: Posets —dual poset⟶ Posets
Mp00205: Posets —maximal antichains⟶ Lattices
St001878: Lattices ⟶ ℤResult quality: 33% ●values known / values provided: 60%●distinct values known / distinct values provided: 33%
Values
['A',1]
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 0 - 3
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(0,1),(0,2)],3)
 => ([(0,1)],2)
 => ? = 2 - 3
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(0,3),(3,1),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => 1 = 4 - 3
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => ([(0,4),(3,5),(4,3),(5,1),(5,2)],6)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 1 = 4 - 3
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(0,3),(0,4),(3,2),(3,5),(4,1),(4,5)],6)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => 1 = 4 - 3
Description
The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L.