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 …

Özet If G is a graph on n vertices, and d (i) is the degree of its i-th vertex, then the Randic
matrix of G is the square matrix of order n whose (i, j)-entry is equal to 1/root d (i) d (j) di if the …

The distance energy of a graph G is a recently developed energy-type invariant, defined as
the absolute deviation of the eigenvalues of the distance matrix of G. It is a useful molecular …

In this paper, we introduce the concept of color energy of a graph, Ec (G) and compute the
color energy Eχ (G) of few families of graphs with minimum number of colors. It depends on …

Three main tools to study graphs mathematically are to make use of the vertex degrees,
distances and matrices. The classical graph energy was defined by means of the adjacency …

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 …

The distance spectral radius ρ (G) of a graph G is the largest eigenvalue of the distance
matrix D (G). Recently, many researches proposed the use of ρ (G) as a molecular structure …

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

The distance matrix of a simple graph G is D (G)=(dij), where dij is the distance between ith
and jth vertices of G. The spectrum of the distance matrix is known as the distance spectrum …