A new combinatorial method using directed graphs identifies matrix patterns that require the non-symmetric strong spectral property, shows that irreducible tridiagonal patterns do not always require it, and confirms a minimum of 2n-1 arcs for several digraph families.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Combinatorial aspects of the non-symmetric strong spectral property for graphs
A new combinatorial method using directed graphs identifies matrix patterns that require the non-symmetric strong spectral property, shows that irreducible tridiagonal patterns do not always require it, and confirms a minimum of 2n-1 arcs for several digraph families.