Split graphs have nullity equal to the nullity of their biadjacency submatrix plus the dimension of their clique-kernel, which is at most one.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the nullspace of split graphs
Split graphs have nullity equal to the nullity of their biadjacency submatrix plus the dimension of their clique-kernel, which is at most one.