The Distance Laplacian Spectral Radius of Clique Trees

Xiaoling Zhang and Jiajia Zhou

Discrete Dynamics in Nature and Society, 2020, vol. 2020, 1-8

Abstract:

The distance Laplacian matrix of a connected graph is defined as , where is the distance matrix of and is the diagonal matrix of vertex transmissions of . The largest eigenvalue of is called the distance Laplacian spectral radius of . In this paper, we determine the graphs with maximum and minimum distance Laplacian spectral radius among all clique trees with vertices and cliques. Moreover, we obtain vertices and cliques.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/DDNS/2020/8855987.pdf (application/pdf)
http://downloads.hindawi.com/journals/DDNS/2020/8855987.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnddns:8855987

DOI: 10.1155/2020/8855987

Access Statistics for this article

More articles in Discrete Dynamics in Nature and Society from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().