On graphs with near minimal distance energy

DOI10.1016/j.laa.2015.03.018zbMath1311.05110OpenAlexW2083797191MaRDI QIDQ2341903

Huiqiu Lin, Stephen W. Drury

Publication date: 6 May 2015

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2015.03.018

zbMATH Keywords

trace normdistance energydistance spectra

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Connectivity (05C40)

Related Items (5)

The distance energy of clique trees ⋮ Solutions to unsolved problems on the minimal energies of two classes of trees ⋮ On energy and Laplacian energy of bipartite graphs ⋮ Sharp upper bounds on the distance energies of a graph ⋮ On the ordering of bicyclic digraphs with respect to energy and iota energy

Cites Work

• The inertia and energy of the distance matrix of a connected graph
• Sharp bounds on the distance spectral radius and the distance energy of graphs
• On the distance matrix of a tree
• Distance spectra of graphs: a survey
• The inertia and energy of distance matrices of complete \(k\)-partite graphs
• On the distance spectrum of graphs
• Graph Energy
• The distance spectrum of a tree
• Distance spectra and distance energies of iterated line graphs of regular graphs
• Matrix Analysis
• On the Addressing Problem for Loop Switching
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On graphs with near minimal distance energy