Your data matches 41 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000068
St000068: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> 1
([],2)
=> 2
([(0,1)],2)
=> 1
([(1,2)],3)
=> 2
([(0,1),(0,2)],3)
=> 1
([(0,2),(2,1)],3)
=> 1
([(0,2),(1,2)],3)
=> 2
([(0,2),(0,3),(3,1)],4)
=> 1
([(0,1),(0,2),(1,3),(2,3)],4)
=> 1
([(0,3),(3,1),(3,2)],4)
=> 1
([(0,3),(1,3),(3,2)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
([(0,3),(2,1),(3,2)],4)
=> 1
([(0,3),(1,2),(2,3)],4)
=> 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 1
([(0,4),(1,4),(2,3),(4,2)],5)
=> 2
([(0,3),(3,4),(4,1),(4,2)],5)
=> 1
([(0,4),(2,3),(3,1),(4,2)],5)
=> 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 1
Description
The number of minimal elements in a poset.
Matching statistic: St000069
Mp00125: Posets dual posetPosets
St000069: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> 1
([],2)
=> ([],2)
=> 2
([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(1,2)],3)
=> ([(1,2)],3)
=> 2
([(0,1),(0,2)],3)
=> ([(0,2),(1,2)],3)
=> 1
([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> 1
([(0,2),(1,2)],3)
=> ([(0,1),(0,2)],3)
=> 2
([(0,2),(0,3),(3,1)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> 1
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 1
([(0,3),(3,1),(3,2)],4)
=> ([(0,3),(1,3),(3,2)],4)
=> 1
([(0,3),(1,3),(3,2)],4)
=> ([(0,3),(3,1),(3,2)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(2,1),(3,2)],4)
=> 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(0,3),(3,1)],4)
=> 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 1
([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(0,3),(3,4),(4,1),(4,2)],5)
=> 2
([(0,3),(3,4),(4,1),(4,2)],5)
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> 1
([(0,4),(2,3),(3,1),(4,2)],5)
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 1
Description
The number of maximal elements of a poset.
Matching statistic: St001621
Mp00195: Posets order idealsLattices
St001621: Lattices ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([(0,1)],2)
=> 1
([],2)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
([(0,1)],2)
=> ([(0,2),(2,1)],3)
=> 1
([(1,2)],3)
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 2
([(0,1),(0,2)],3)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 1
([(0,2),(2,1)],3)
=> ([(0,3),(2,1),(3,2)],4)
=> 1
([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 2
([(0,2),(0,3),(3,1)],4)
=> ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> 1
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> 1
([(0,3),(3,1),(3,2)],4)
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> 1
([(0,3),(1,3),(3,2)],4)
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> 2
([(0,3),(2,1),(3,2)],4)
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
=> 1
([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
=> 2
([(0,3),(3,4),(4,1),(4,2)],5)
=> ([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7)
=> 1
([(0,4),(2,3),(3,1),(4,2)],5)
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
=> 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> 1
Description
The number of atoms of a lattice. An element of a lattice is an '''atom''' if it covers the least element.
Mp00195: Posets order idealsLattices
St001878: Lattices ⟶ ℤResult quality: 95% values known / values provided: 95%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([(0,1)],2)
=> ? = 1
([],2)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
([(0,1)],2)
=> ([(0,2),(2,1)],3)
=> 1
([(1,2)],3)
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 2
([(0,1),(0,2)],3)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 1
([(0,2),(2,1)],3)
=> ([(0,3),(2,1),(3,2)],4)
=> 1
([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 2
([(0,2),(0,3),(3,1)],4)
=> ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> 1
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> 1
([(0,3),(3,1),(3,2)],4)
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> 1
([(0,3),(1,3),(3,2)],4)
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> 2
([(0,3),(2,1),(3,2)],4)
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
=> 1
([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
=> 2
([(0,3),(3,4),(4,1),(4,2)],5)
=> ([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7)
=> 1
([(0,4),(2,3),(3,1),(4,2)],5)
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
=> 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> 1
Description
The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L.
Mp00198: Posets incomparability graphGraphs
Mp00247: Graphs de-duplicateGraphs
St000777: Graphs ⟶ ℤResult quality: 40% values known / values provided: 40%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> ([],1)
=> 1
([],2)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 2
([(0,1)],2)
=> ([],2)
=> ([],1)
=> 1
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 1
([(0,2),(2,1)],3)
=> ([],3)
=> ([],1)
=> 1
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 2
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> ? = 2
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> ([],1)
=> 1
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 2
([(0,3),(3,4),(4,1),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> ([],1)
=> 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ([],6)
=> ([],1)
=> 1
Description
The number of distinct eigenvalues of the distance Laplacian of a connected graph.
Matching statistic: St001232
Mp00110: Posets Greene-Kleitman invariantInteger partitions
Mp00043: Integer partitions to Dyck pathDyck paths
St001232: Dyck paths ⟶ ℤResult quality: 40% values known / values provided: 40%distinct values known / distinct values provided: 100%
Values
([],1)
=> [1]
=> [1,0,1,0]
=> 1
([],2)
=> [1,1]
=> [1,0,1,1,0,0]
=> 2
([(0,1)],2)
=> [2]
=> [1,1,0,0,1,0]
=> 1
([(1,2)],3)
=> [2,1]
=> [1,0,1,0,1,0]
=> ? = 2
([(0,1),(0,2)],3)
=> [2,1]
=> [1,0,1,0,1,0]
=> ? = 1
([(0,2),(2,1)],3)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,2),(1,2)],3)
=> [2,1]
=> [1,0,1,0,1,0]
=> ? = 2
([(0,2),(0,3),(3,1)],4)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> ? = 1
([(0,1),(0,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> ? = 1
([(0,3),(3,1),(3,2)],4)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> ? = 1
([(0,3),(1,3),(3,2)],4)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> ? = 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> [2,2]
=> [1,1,0,0,1,1,0,0]
=> 2
([(0,3),(2,1),(3,2)],4)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
([(0,3),(1,2),(2,3)],4)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> ? = 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> ? = 1
([(0,4),(1,4),(2,3),(4,2)],5)
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> ? = 2
([(0,3),(3,4),(4,1),(4,2)],5)
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> ? = 1
([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> ? = 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> 1
Description
The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2.
Mp00198: Posets incomparability graphGraphs
Mp00247: Graphs de-duplicateGraphs
St001645: Graphs ⟶ ℤResult quality: 40% values known / values provided: 40%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> ([],1)
=> 1
([],2)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 2
([(0,1)],2)
=> ([],2)
=> ([],1)
=> 1
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 1
([(0,2),(2,1)],3)
=> ([],3)
=> ([],1)
=> 1
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 2
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> ? = 2
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> ([],1)
=> 1
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 2
([(0,3),(3,4),(4,1),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> ([],1)
=> 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ([],6)
=> ([],1)
=> 1
Description
The pebbling number of a connected graph.
Mp00198: Posets incomparability graphGraphs
Mp00247: Graphs de-duplicateGraphs
St000259: Graphs ⟶ ℤResult quality: 40% values known / values provided: 40%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([],2)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1 = 2 - 1
([(0,1)],2)
=> ([],2)
=> ([],1)
=> 0 = 1 - 1
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1 = 2 - 1
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 1 - 1
([(0,2),(2,1)],3)
=> ([],3)
=> ([],1)
=> 0 = 1 - 1
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 2 - 1
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 1 - 1
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 1 - 1
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 1 - 1
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 2 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> ? = 2 - 1
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 2 - 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 - 1
([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 2 - 1
([(0,3),(3,4),(4,1),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 - 1
([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 - 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ([],6)
=> ([],1)
=> 0 = 1 - 1
Description
The diameter of a connected graph. This is the greatest distance between any pair of vertices.
Mp00198: Posets incomparability graphGraphs
Mp00247: Graphs de-duplicateGraphs
St000260: Graphs ⟶ ℤResult quality: 40% values known / values provided: 40%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([],2)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1 = 2 - 1
([(0,1)],2)
=> ([],2)
=> ([],1)
=> 0 = 1 - 1
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1 = 2 - 1
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 1 - 1
([(0,2),(2,1)],3)
=> ([],3)
=> ([],1)
=> 0 = 1 - 1
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 2 - 1
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 1 - 1
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 1 - 1
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 1 - 1
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 2 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> ? = 2 - 1
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 2 - 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 - 1
([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 2 - 1
([(0,3),(3,4),(4,1),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 - 1
([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 - 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ([],6)
=> ([],1)
=> 0 = 1 - 1
Description
The radius of a connected graph. This is the minimum eccentricity of any vertex.
Mp00198: Posets incomparability graphGraphs
Mp00247: Graphs de-duplicateGraphs
St000466: Graphs ⟶ ℤResult quality: 40% values known / values provided: 40%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([],2)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1 = 2 - 1
([(0,1)],2)
=> ([],2)
=> ([],1)
=> 0 = 1 - 1
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1 = 2 - 1
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 1 - 1
([(0,2),(2,1)],3)
=> ([],3)
=> ([],1)
=> 0 = 1 - 1
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 2 - 1
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 1 - 1
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 1 - 1
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 1 - 1
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 2 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> ? = 2 - 1
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 2 - 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 - 1
([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 2 - 1
([(0,3),(3,4),(4,1),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 - 1
([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 - 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ([],6)
=> ([],1)
=> 0 = 1 - 1
Description
The Gutman (or modified Schultz) index of a connected graph. This is $$\sum_{\{u,v\}\subseteq V} d(u)d(v)d(u,v)$$ where $d(u)$ is the degree of vertex $u$ and $d(u,v)$ is the distance between vertices $u$ and $v$. For trees on $n$ vertices, the modified Schultz index is related to the Wiener index via $S^\ast(T)=4W(T)-(n-1)(2n-1)$ [1].
The following 31 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000741The Colin de Verdière graph invariant. St001330The hat guessing number of a graph. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000302The determinant of the distance matrix of a connected graph. St000467The hyper-Wiener index of a connected graph. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001877Number of indecomposable injective modules with projective dimension 2. St000100The number of linear extensions of a poset. St000282The size of the preimage of the map 'to poset' from Ordered trees to Posets. St000524The number of posets with the same order polynomial. St000525The number of posets with the same zeta polynomial. St000526The number of posets with combinatorially isomorphic order polytopes. St000633The size of the automorphism group of a poset. St000635The number of strictly order preserving maps of a poset into itself. St000640The rank of the largest boolean interval in a poset. St000910The number of maximal chains of minimal length in a poset. St000914The sum of the values of the Möbius function of a poset. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001890The maximum magnitude of the Möbius function of a poset. St000848The balance constant multiplied with the number of linear extensions of a poset. St000849The number of 1/3-balanced pairs in a poset. St000850The number of 1/2-balanced pairs in a poset. St001095The number of non-isomorphic posets with precisely one further covering relation. St001570The minimal number of edges to add to make a graph Hamiltonian. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St001060The distinguishing index of a graph.