Bibliographic Details
| Title: |
On generalized distance spectral radius and generalized distance energy of graphs. |
| Authors: |
Khan, Zia Ullah1,2 (AUTHOR) z.u.khan@sjtu.edu.cn, Zhang, Xiao-Dong1 (AUTHOR) xiaodong@sjtu.edu.cn |
| Superior Title: |
Discrete Mathematics, Algorithms & Applications. Nov2023, Vol. 15 Issue 8, p1-16. 16p. |
| Subject Terms: |
*MATHEMATICAL bounds, *GRAPH connectivity, *LAPLACIAN matrices, *SPECTRAL theory |
| Abstract: |
For a simple connected graph G , let D (G) and T (G) be the distance matrix and the diagonal matrix of the vertex transmissions, respectively. The convex linear combination D α (G) of D (G) and T (G) is defined as, D α (G) = α T (G) + (1 − α) D (G) , 0 ≤ α ≤ 1. The matrix D α (G) , known as generalized distance matrix, is effective in merging the distance spectral and distance signless Laplacian spectral theories. In this paper, we study the spectral radius and energy of the generalized distance matrix D α (G) of a graph G. We obtain bounds for the generalized distance spectral radius and generalized distance energy of connected graphs in terms of various parameters associated with the structure of graph. [ABSTRACT FROM AUTHOR] |
|
Copyright of Discrete Mathematics, Algorithms & Applications is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Academic Search Premier |
