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 of a graph G are the eigenvalues of its distance matrix D, and the D-
energy ED (G) is the sum of the absolute values of its D-eigenvalues. Two graphs are said to …

In this chapter we are concerned with the eigenvalues of graphs and some of their chemical
applications. Let G be a (simple) graph, with vertex set V (G) and edge set E (G). The …

On a Pair of Equienergetic Graphs Page 1 MATCH Communications in Mathematical and in
Computer Chemistry MATCH Commun. Math. Comput. Chem. 55 (2006) 83-90 ISSN 0340 …

The energy E (G) of a graph G is the sum of the absolute values of the eigenvalues of G. Two
graphs, G 1 and G 2, are said to be equienergetic if E (G 1)= E (G 2). We report here the …

The energy of a graph G is the sum of the absolute values of its eigenvalues. Two non-
isomorphic graphs of same order are said to be equienergetic if their energies are equal. In …

A note on energy of some graphs Page 1 A note on energy of some graphs G. Indulal∗
Department of Mathematics, St.Aloysius College Edathua, Alappuzha - 689693, India and A …

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 …

The distance energy ED (G) of a graph G is defined as the sum of the absolute values of the
eigenvalues of the distance matrix of G. The graphs G1 and G2 are said to be distance …

For a graph G with vertex set V (G)={v1, v2,..., vn}, the extended double cover G∗ is a
bipartite graph with bipartition (X, Y), X={x1, x2,..., xn} and Y={y1, y2,..., yn}, where two …