On distance Laplacian energy in terms of graph invariants
From MaRDI portal
Publication:6132974
Abstract: For a simple connected graph of order having distance Laplacian eigenvalues , the distance Laplacian energy is defined as , where is the Wiener index of . 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 in terms of the order , the Wiener index , 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 . 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 .
Cites work
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- scientific article; zbMATH DE number 6304422 (Why is no real title available?)
- Distance spectra of graphs: a survey
- Further developments on Brouwer's conjecture for the sum of Laplacian eigenvalues of graphs
- Graph energy
- Laplacian energy of a graph
- On (distance) Laplacian energy and (distance) signless Laplacian energy of graphs
- On distance Laplacian spectrum (energy) of graphs
- On distance energy of graphs
- On the Laplacian eigenvalues of a graph and Laplacian energy
- On the distance Laplacian energy ordering of a tree
- Oriented bipartite graphs with minimal trace norm
- Sharp upper bounds on the distance energies of a graph
- Signless Laplacian energy of a graph and energy of a line graph
- Some properties of the distance Laplacian eigenvalues of a graph.
- Spectra of graphs
- Two Laplacians for the distance matrix of a graph
Cited in
(6)- On Laplacian energy in terms of graph invariants
- Distance Laplacian spectra of graphs: a survey
- Counting spanning trees of multiple complete split-like graph containing a given spanning forest
- On distance Laplacian spectral ordering of some graphs
- The inertia and energy of distance matrices of complete \(k\)-partite graphs
- 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)