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 …

Graph theory experienced a tremendous growth in the 20th century. One of the main
reasons for this phenomenon is the applicability of graph theory in other disciplines such as …

Ö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 …

In this paper, we investigate the predictive potential of commonly occurring spectrum-based
distance descriptors which are based on eigenvalues of distance-related chemical matrices …

In this paper we introduce a new kind of graph energy, the minimum covering energy, Ec
(G). It depends both on the underlying graph G, and on its particular minimum cover C …

Graph signal processing deals with signals whose domain, defined by a graph, is irregular.
The total-electron energy or simply the-electronic energy, as calculated within the Hückel …

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 …

Sažetak The total π-electron energy, as calculated within the Hückel tight-binding molecular
orbital approximation, is a quantum-theoretical characteristic of conjugated molecules that …

The energy E (G) of a graph G is the sum of absolute values of the eigenvalues of the
adjacency matrix of G. This spectral quantitywas introduced in 1978 by Ivan Gutman, but its …