The spread of generalized reciprocal distance matrix

MaRDI QIDQ6404655zbMATH OpenFDO

Authors Hechao Liu, Yufei Huang

Publication date 7 July 2022

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Abstract: The generalized reciprocal distance matrix $R{D}_{alpha}(G)$ was defined as $R{D}_{alpha}(G)=alphaRT(G)+(1-alpha)RD(G),quad0leqalphaleq1.$ Let $lambd{a}_1(R{D}_{alpha}(G))geqlambd{a}_2(R{D}_{alpha}(G))geqcdotsgeqlambd{a}_n(R{D}_{alpha}(G))$ be the eigenvalues of $R{D}_{alpha}$ matrix of graphs $G$. Then the $R{D}_{alpha}$-spread of graph $G$ can be defined as $S_{R{D}_{alpha}}(G)=lambd{a}_1(R{D}_{alpha}(G))-lambd{a}_n(R{D}_{alpha}(G))$. In this paper, we first obtain some sharp lower and upper bounds for the $R{D}_{alpha}$-spread of graphs. Then we determine the lower bounds for the $R{D}_{alpha}$-spread of bipartite graphs and graphs with given clique number. At last, we give the $R{D}_{alpha}$-spread of double star graphs. Our results generalize the related results of the reciprocal distance matrix and reciprocal distance signless Laplacian matrix.

This page was built for publication: The spread of generalized reciprocal distance matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6404655)