On distance Laplacian energy in terms of graph invariants

DOI10.21136/CMJ.2023.0421-20arXiv2112.02527MaRDI QIDQ6132974FDOQ6132974

Bilal Ahmad Rather, Rezwan Ul Shaban, Shariefuddin Pirzada, Hilal A. Ganie

Publication date: 17 August 2023

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Abstract: For a simple connected graph $G$ of order $n$ having distance Laplacian eigenvalues $h{o}_1^{L}geqh{o}_2^{L}geqcdotsgeqh{o}_n^L$, the distance Laplacian energy $DLE(G)$ is defined as $DLE(G)=su{m}_{i=1}^{n}left|h{o}_i^L-frac2W(G)night|$, where $W(G)$ is the Wiener index of $G$. We obtain a relationship between the Laplacian energy and distance Laplacian energy for graphs with diameter 2. We obtain lower bounds for the distance Laplacian energy $DLE(G)$ in terms of the order $n$, the Wiener index $W(G)$, independence number, vertex connectivity number and other given parameters. We characterize the extremal graphs attaining these bounds. We show that the complete bipartite graph has the minimum distance Laplacian energy among all connected bipartite graphs and complete split graph has the minimum distance Laplacian energy among all connected graphs with given independence number. Further, we obtain the distance Laplacian spectrum of the join of a graph with the union of two other graphs. We show that the graph $$, has the minimum distance Laplacian energy among all connected graphs with vertex connectivity $k$. We conclude this paper with a discussion on trace norm of a matrix and the importance of our results in the theory of trace norm of the matrix $D^L(G)-frac2W(G)n{I}_n$.

Full work available at URL: https://arxiv.org/abs/2112.02527

zbMATH Keywords

energydistance matrixdistance Laplacian matrixdistance Laplacian energy

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12)

Cites Work

• Graph Energy
• Spectra of graphs
• Distance spectra of graphs: a survey
• Two Laplacians for the distance matrix of a graph
• Title not available (Why is that?)
• On the Laplacian eigenvalues of a graph and Laplacian energy
• Laplacian energy of a graph
• Title not available (Why is that?)
• Some properties of the distance Laplacian eigenvalues of a graph
• On the distance Laplacian energy ordering of a tree
• Sharp upper bounds on the distance energies of a graph
• Oriented bipartite graphs with minimal trace norm
• Signless Laplacian energy of a graph and energy of a line graph
• On (distance) Laplacian energy and (distance) signless Laplacian energy of graphs
• Title not available (Why is that?)
• On distance Laplacian spectrum (energy) of graphs
• Further developments on Brouwer's conjecture for the sum of Laplacian eigenvalues of graphs

Cited In (6)

• On distance Laplacian spectral ordering of some graphs
• On Laplacian energy in terms of graph invariants
• The inertia and energy of distance matrices of complete \(k\)-partite graphs
• Counting spanning trees of multiple complete split-like graph containing a given spanning forest
• Distance Laplacian spectra of graphs: a survey
• Distance Laplacian spectral ordering of sun type graphs

This page was built for publication: On distance Laplacian energy in terms of graph invariants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132974)