Distance Laplacian spectral ordering of sun type graphs

Bilal A. Rather, Hilal A. Ganie and Yilun Shang

Applied Mathematics and Computation, 2023, vol. 445, issue C

Abstract: Let G be a simple, connected graph of order n. Its distance Laplacian energy DLE(G) is given by DLE(G)=∑i=1n|ρiL−2W(G)n|, where ρ1L≥ρ2L≥⋯≥ρnL are the distance Laplacian eigenvalues and W(G) is the Wiener index of G. Distance Laplacian eigenvalues of sun and partial sun graphs have been characterized. We order the partial sun graphs by using their second largest distance Laplacian eigenvalue. Moreover, the distance Laplacian energy of sun and partial sun graphs have been derived in this paper. These graphs are also ordered by using their distance Laplacian energies.

Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300323000164
Full text for ScienceDirect subscribers only

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:eee:apmaco:v:445:y:2023:i:c:s0096300323000164

DOI: 10.1016/j.amc.2023.127847

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().