التفاصيل البيبلوغرافية
| العنوان: |
ON THE GENERALIZED DISTANCE EIGENVALUES OF GRAPHS. |
| المؤلفون: |
Alhevaz, A., Baghipur, M., Ganie, H. A., Das, K. C. |
| المصدر: |
Matematicki Vesnik; Mar2024, Vol. 76 Issue 1, p29-42, 14p |
| مصطلحات موضوعية: |
EIGENVALUES, GRAPH connectivity, HYPERCUBES, REGULAR graphs |
| مستخلص: |
For a simple connected graph G, the generalized distance matrix Dα(G) is defined as Dα(G) = αTr(G) + (1 - α)D(G), 0 ≤ α ≤ 1. The largest eigenvalue of Dα(G) is called the generalized distance spectral radius or Dα-spectral radius of G. In this paper, we obtain some upper bounds for the generalized distance spectral radius in terms of various graph parameters associated with the structure of graph G, and characterize the extremal graphs attaining these bounds. We determine the graphs with minimal generalized distance spectral radius among the trees with given diameter d and among all unicyclic graphs with given girth. We also obtain the generalized distance spectrum of the square of the cycle and the square of the hypercube of dimension n. We show that the square of the hypercube of dimension n has three distinct generalized distance eigenvalues. [ABSTRACT FROM AUTHOR] |
|
Copyright of Matematicki Vesnik is the property of Mathematical Society of Serbia 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.) |
| قاعدة البيانات: |
Complementary Index |
Full Text Finder