This book is about graph energy. The authors have included many of the important results
on graph energy, such as the complete solution to the conjecture on maximal energy of …

Abstract In 1971, Graham and Pollack established a relationship between the number of
negative eigenvalues of the distance matrix and the addressing problem in data …

Written for mathematicians working with the theory of graph spectra, this book explores more
than 400 inequalities for eigenvalues of the six matrices associated with finite simple graphs …

Consider an undirected and connected graph G=(VG, EG), where VG and EG represent the
set of vertices and the set of edges respectively. The concept of edge version of metric …

The distance energy of a graph G is a recently developed energy-type invariant, defined as
the sum of absolute values of the eigenvalues of the distance matrix of G. There was a vast …

For a connected graph, the distance spectral radius is the largest eigenvalue of its distance
matrix, and the distance energy is defined as the sum of the absolute values of the …

Edge metric dimension of graphs Page 1 Edge metric dimension of graphs Ruby Nasir, Sohail
Zafar, Zohaib Zahid. Department of Mathematics, UMT, Lahore rubynasir76@gmail.com …

ENERGIES OF GRAPHS SURVEY, CENSUS, BIBLIOGRAPHY Ivan Gutman & Boris Furtula
Page 1 ENERGIES OF GRAPHS SURVEY, CENSUS, BIBLIOGRAPHY Ivan Gutman & Boris …

Let G be a simple, connected graph, D (G) be the distance matrix of G, and Tr (G) be the
diagonal matrix of vertex transmissions of G. The distance signless Laplacian matrix of G is …

Let G be a simple connected graph, vi its vertex, and Di the sum of distances between vi and
the other vertices of G. Let δ1, δ2,..., δn be the eigenvalues of the distance matrix D of G, and …