Identifier
Values
([],1) => ([],1) => ([],1) => ([],1) => 0
([(0,1)],2) => ([(0,1)],2) => ([],2) => ([(0,1)],2) => 1
([(0,2),(2,1)],3) => ([(0,2),(2,1)],3) => ([],3) => ([(0,1),(0,2),(1,2)],3) => 2
([(0,3),(2,1),(3,2)],4) => ([(0,3),(2,1),(3,2)],4) => ([],4) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 3
([(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,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 3
([(0,4),(2,3),(3,1),(4,2)],5) => ([(0,4),(2,3),(3,1),(4,2)],5) => ([],5) => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 4
([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([(0,5),(2,4),(3,2),(4,1),(5,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) => 5
([(0,5),(1,6),(2,6),(3,2),(4,1),(5,3),(5,4)],7) => ([(0,5),(1,6),(2,6),(3,2),(4,1),(5,3),(5,4)],7) => ([(3,5),(3,6),(4,5),(4,6)],7) => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 5
([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => ([],7) => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 6
([(0,4),(0,5),(1,6),(2,6),(4,2),(5,1),(6,3)],7) => ([(0,4),(0,5),(1,6),(2,6),(4,2),(5,1),(6,3)],7) => ([(3,5),(3,6),(4,5),(4,6)],7) => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 5
search for individual values
searching the database for the individual values of this statistic
/ search for generating function
searching the database for statistics with the same generating function
Description
The largest eigenvalue of a graph if it is integral.
If a graph is $d$-regular, then its largest eigenvalue equals $d$. One can show that the largest eigenvalue always lies between the average degree and the maximal degree.
This statistic is undefined if the largest eigenvalue of the graph is not integral.
Map
to poset
Description
Return the poset corresponding to the lattice.
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.
Map
incomparability graph
Description
The incomparability graph of a poset.