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
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Develops an algorithm to compute the SNT-rank of C4-free graphs by optimizing the number of bipartite components in star covers.
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.
-
Optimization problem for star covers of graphs without four cycles
Develops an algorithm to compute the SNT-rank of C4-free graphs by optimizing the number of bipartite components in star covers.