Bounds and extremal characterizations are obtained for the generalized distance spectral spread of graphs, including relations to the distance spectral spread and specific lower bounds for bipartite graphs and in terms of clique and independence numbers.
Title resolution pending
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
-
On spectral spread of generalized distance matrix of a graph
Bounds and extremal characterizations are obtained for the generalized distance spectral spread of graphs, including relations to the distance spectral spread and specific lower bounds for bipartite graphs and in terms of clique and independence numbers.