312
Views
6
CrossRef citations to date
0
Altmetric
Articles

On spectral spread of generalized distance matrix of a graph

ORCID Icon, ORCID Icon, ORCID Icon & ORCID Icon
Pages 2819-2835 | Received 12 Oct 2019, Accepted 19 Aug 2020, Published online: 06 Sep 2020
 

ABSTRACT

For a simple connected graph G, let D(G), Tr(G), DL(G) and DQ(G), 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 Dα(G) of G is the convex linear combinations of Tr(G) and D(G) and is defined as Dα(G)=αTr(G)+(1α)D(G), for 0α1. As D0(G)=D(G),  2D12(G)=DQ(G),   D1(G)=Tr(G) and Dα(G)Dβ(G)=(αβ)DL(G), this matrix reduces to merging the distance spectral and distance signless Laplacian spectral theories. Let 1(G)2(G)n(G) be the eigenvalues of Dα(G) and let SDα(G)=1(G)n(G) be the generalized distance spectral spread of the graph G. In this paper, we obtain bounds for the generalized distance spectral spread SDα(G). We also obtain a relation between the generalized distance spectral spread SDα(G) and the distance spectral spread SD(G). Further, we obtain lower bounds for SDα(G) of bipartite graphs involving different graph parameters and we characterize the extremal graphs for some cases. We also obtain lower bounds for SDα(G) 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.

Additional information

Funding

The research of S. Pirzada is supported by SERB-DST, New Delhi under the research project number MTR/2017/000084.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.