ABSTRACT
For a simple connected graph G, let , , and , respectively, are the distance matrix, the diagonal matrix of the vertex transmissions, distance Laplacian matrix and the distance signless Laplacian matrix. The generalized distance matrix of G is the convex linear combinations of and and is defined as , for . As and , this matrix reduces to merging the distance spectral and distance signless Laplacian spectral theories. Let be the eigenvalues of and let be the generalized distance spectral spread of the graph G. In this paper, we obtain bounds for the generalized distance spectral spread . We also obtain a relation between the generalized distance spectral spread and the distance spectral spread . Further, we obtain lower bounds for of bipartite graphs involving different graph parameters and we characterize the extremal graphs for some cases. We also obtain lower bounds for in terms of clique number and independence number of the graph G and characterize the extremal graphs for some cases.
AMS Subject Classifications:
Acknowledgments
We sincerely thank the three anonymous referees whose valuable comments and suggestions resulted in the improvement to the presentation of this paper. The research of S. Pirzada is supported by SERB-DST, New Delhi under the research project number MTR/2017/000084.
Disclosure statement
No potential conflict of interest was reported by the authors.