Energy of a graph and Randic index - ScienceDirect Skip to main contentSkip to article Elsevier
logo Journals & Books Search RegisterSign in View PDF Download full issue Search …

The energy of a graph G, denoted by E (G), is defined as the sum of absolute values of all
eigenvalues of G. In (MATCH Commun. Math. Comput. Chem. 83 (2020) 631–633) it was …

Let G be a simple graph of order n. The eigenvalue of a graph G is the eigenvalue of its
adjacency matrix. The energy E (G) of G is the sum of absolute values of its eigenvalues. A …

A new graph product is defined in this paper and several applications of this product are
described. The adjacency matrix of the product graph is given and its complete spectrum in …

The energy of a graph is the sum of the absolute values of its eigenvalues. In this article, an
exact relation between the energy of extended bipartite double graph and the energy of a …

Let G be a graph of order n with the vertex set V (G)={v 1, v 2,…, vn}. The strong double
graph Sd (G) of a graph G is a graph obtained by taking two copies of G in which a vertex vi …

A general graph operation is defined and some of its applications are given in this paper.
The adjacency spectrum of any graph generated by this operation is given. A method for …

The energy of a graph G, denoted by E (G), is defined as the sum of absolute values of all
eigenvalues of G. A graph of order n, whose energy is less than n, ie, E (G)< n, is said to be …

The energy of a graph G, E (G), is the sum of absolute values of the eigenvalues of its
adjacency matrix. This concept was extended by Nikiforov to arbitrary complex matrices …

The energy E (G) of a graph G is defined as the sum of the absolute values of the
eigenvalues of its adjacency matrix. If the energy of a graph G of order n is equal to its order …