Introduces the class G^SSP of graphs where all associated symmetric matrices have the strong spectral property and characterizes the trees in this class.
Some connectivity properties for ex cluded mi- nors of the graph invariant ν(G)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The strong spectral property for graphs
Introduces the class G^SSP of graphs where all associated symmetric matrices have the strong spectral property and characterizes the trees in this class.