The Distance Laplacian Spectral Radius of Clique Trees
Joint Authors
Source
Discrete Dynamics in Nature and Society
Issue
Vol. 2020, Issue 2020 (31 Dec. 2020), pp.1-8, 8 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2020-12-09
Country of Publication
Egypt
No. of Pages
8
Main Subjects
Abstract EN
The distance Laplacian matrix of a connected graph G is defined as ℒG=TrG−DG, where DG is the distance matrix of G and TrG is the diagonal matrix of vertex transmissions of G.
The largest eigenvalue of ℒG is called the distance Laplacian spectral radius of G.
In this paper, we determine the graphs with maximum and minimum distance Laplacian spectral radius among all clique trees with n vertices and k cliques.
Moreover, we obtainn vertices and k cliques.
American Psychological Association (APA)
Zhang, Xiaoling& Zhou, Jiajia. 2020. The Distance Laplacian Spectral Radius of Clique Trees. Discrete Dynamics in Nature and Society،Vol. 2020, no. 2020, pp.1-8.
https://search.emarefa.net/detail/BIM-1153557
Modern Language Association (MLA)
Zhang, Xiaoling& Zhou, Jiajia. The Distance Laplacian Spectral Radius of Clique Trees. Discrete Dynamics in Nature and Society No. 2020 (2020), pp.1-8.
https://search.emarefa.net/detail/BIM-1153557
American Medical Association (AMA)
Zhang, Xiaoling& Zhou, Jiajia. The Distance Laplacian Spectral Radius of Clique Trees. Discrete Dynamics in Nature and Society. 2020. Vol. 2020, no. 2020, pp.1-8.
https://search.emarefa.net/detail/BIM-1153557
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1153557