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 …

The D-eigenvalues {μ1, μ2,…,…, μp} of a graph G are the eigenvalues of its distance matrix
D and form the D-spectrum of G denoted by specD (G). The greatest D-eigenvalue is called …

On the distance spectra of some graphs Page 1 Mathematical Communications 13(2008),
123-131 123 On the distance spectra of some graphs Gopalapillai Indulal∗ and Ivan Gutman† …

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 …

The graph G σ is obtained from graph G by attaching self loops on σ vertices. The energy E
(G σ) of the graph G σ with order n and eigenvalues λ 1, λ 2,⋯, λ n is defined as E (G σ)=∑ i …

The energy of a graph is equal to the sum of the absolute values of its eigenvalues. The
energy of a matrix is equal to the sum of its singular values. We establish relations between …

The distance or D-eigenvalues of a graph G are the eigenvalues of its distance matrix. The
distance or D-energy ED (G) of the graph G is the sum of the absolute values of its D …

I. Gutman et al. have recently conjectured that the energy of a graph does not exceed its
Laplacian energy. We disprove this conjecture by giving a few small counterexamples and …

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

The skew energy of a digraph D is defined as the sum of the singular values of its skew
adjacency matrix S (D). In this paper, we first interpret the entries of the power of the skew …