Loading [MathJax]/jax/output/CommonHTML/jax.js
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

On distance Laplacian spectrum (energy) of graphs

    https://doi.org/10.1142/S1793830920500615Cited by:16 (Source: Crossref)

    For a simple connected graph G of order n having distance Laplacian eigenvalues ρL1ρL2ρLn, the distance Laplacian energy DLE(G) is defined as DLE(G)=ni=1|ρLi2W(G)n|, where W(G) is the Wiener index of G. We obtain the distance Laplacian spectrum of the joined union of graphs G1,G2,,Gn in terms of their distance Laplacian spectrum and the spectrum of an auxiliary matrix. As application, we obtain the distance Laplacian spectrum of the lexicographic product of graphs. We study the distance Laplacian energy of connected graphs with given chromatic number χ. We show that among all connected graphs with chromatic number χ the complete χ-partite graph has the minimum distance Laplacian energy. Further, we discuss the distribution of distance Laplacian eigenvalues around average transmission degree 2W(G)n.

    AMSC: 05C50, 05C12, 15A18