Identifier
Values
['A',1] => ([],1) => ([],1) => 1
['A',2] => ([(0,2),(1,2)],3) => ([(1,2)],3) => 2
['B',2] => ([(0,3),(1,3),(3,2)],4) => ([(2,3)],4) => 3
['G',2] => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6) => ([(4,5)],6) => 5
['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) => 4
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 number of distinct columns in the nullspace of a graph.
Let $A$ be the adjacency matrix of a graph on $n$ vertices, and $K$ a $n\times d$ matrix whose column vectors form a basis of the nullspace of $A$. Then any other matrix $K'$ whose column vectors also form a basis of the nullspace is related to $K$ by $K' = K T$ for some invertible $d\times d$ matrix $T$. Any two rows of $K$ are equal if and only if they are equal in $K'$.
The nullspace of a graph is usually written as a $d\times n$ matrix, hence the name of this statistic.
Let $A$ be the adjacency matrix of a graph on $n$ vertices, and $K$ a $n\times d$ matrix whose column vectors form a basis of the nullspace of $A$. Then any other matrix $K'$ whose column vectors also form a basis of the nullspace is related to $K$ by $K' = K T$ for some invertible $d\times d$ matrix $T$. Any two rows of $K$ are equal if and only if they are equal in $K'$.
The nullspace of a graph is usually written as a $d\times n$ matrix, hence the name of this statistic.
Map
incomparability graph
Description
The incomparability graph of a poset.
Map
to root poset
Description
The root poset of a finite Cartan type.
This is the poset on the set of positive roots of its root system where $\alpha \prec \beta$ if $\beta - \alpha$ is a simple root.
This is the poset on the set of positive roots of its root system where $\alpha \prec \beta$ if $\beta - \alpha$ is a simple root.
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!