We obtain upper and lower bounds on the average energy of circulant graphs with n vertices and regularity d. The average is taken over all representations of such graphs by circulant adjacency matrices.8 page(s
Let A(G) be the adjacency matrix and D(G) be the diagonal matrix of the vertex degrees of a simple c...
AbstractFor a simple graph G, the energy E(G) is defined as the sum of the absolute values of all th...
In this paper, we give two upper bounds for the extended energy of a graph one in terms of ordinary ...
AbstractWe obtain upper and lower bounds on the average energy of circulant graphs with n vertices a...
A graph is called textit{circulant} if it is a Cayley graph on acyclic group, i.e. its adjacency mat...
We give an explicit construction of circulant graphs of very high energy. This construction is based...
AbstractWe give an explicit construction of circulant graphs of very high energy. This construction ...
Abstract. A graph is called circulant if it is a Cayley graph on a cyclic group, i.e. its adjacency ...
The energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. We study ...
AbstractThe energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. I...
AbstractThe energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. W...
Abstract The energy of a graph G is defined as the sum of the singular values of its adjacency matri...
The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. ...
In this article, we compute the oblique asymptote of the energy function for all connected cubic cir...
Let G be a finite simple undirected graph with n vertices and m edges. The energy of a graph G , den...
Let A(G) be the adjacency matrix and D(G) be the diagonal matrix of the vertex degrees of a simple c...
AbstractFor a simple graph G, the energy E(G) is defined as the sum of the absolute values of all th...
In this paper, we give two upper bounds for the extended energy of a graph one in terms of ordinary ...
AbstractWe obtain upper and lower bounds on the average energy of circulant graphs with n vertices a...
A graph is called textit{circulant} if it is a Cayley graph on acyclic group, i.e. its adjacency mat...
We give an explicit construction of circulant graphs of very high energy. This construction is based...
AbstractWe give an explicit construction of circulant graphs of very high energy. This construction ...
Abstract. A graph is called circulant if it is a Cayley graph on a cyclic group, i.e. its adjacency ...
The energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. We study ...
AbstractThe energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. I...
AbstractThe energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. W...
Abstract The energy of a graph G is defined as the sum of the singular values of its adjacency matri...
The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. ...
In this article, we compute the oblique asymptote of the energy function for all connected cubic cir...
Let G be a finite simple undirected graph with n vertices and m edges. The energy of a graph G , den...
Let A(G) be the adjacency matrix and D(G) be the diagonal matrix of the vertex degrees of a simple c...
AbstractFor a simple graph G, the energy E(G) is defined as the sum of the absolute values of all th...
In this paper, we give two upper bounds for the extended energy of a graph one in terms of ordinary ...
DOI
Add to ORKG