Add to ORKGAbstract. A graph is called circulant if it is a Cayley graph on a cyclic group, i.e. its adjacency matrix is circulant. Let D be a set of positive, proper divisors of the integer n> 1. The integral circulant graph ICGn(D) has the vertex set Zn and the edge set E(ICGn(D)) = {{a, b}; gcd(a − b, n) ∈ D}. Let n = p1p2 · · · pkm, where p1, p2, · · · , pk are distinct prime numbers and gcd(p1p2 · · · pk,m) = 1. The open problem posed in paper [A. Ilić, The energy of unitary Cayley graphs, Linear Algebra Appl., 431 (2009) 1881–1889] about calculating the energy of an arbitrary integral circulant ICGn(D) is completely solved in this paper, where D = {p1, p2,..., pk}. 1
AbstractWe obtain upper and lower bounds on the average energy of circulant graphs with n vertices a...
From a generalization to $Z^n$ of the concept of congruence we define a family of regular digraphs o...
A graph X is said to be integral if all eigenvalues of the adjacency matrix of X are integers. This...
A graph is called textit{circulant} if it is a Cayley graph on acyclic group, i.e. its adjacency mat...
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. W...
AbstractThe energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. I...
The energy of a graph was introduced by {\sc Gutman} in 1978 as the sum of the absolute values of th...
AbstractThe distance energy of a graph G is a recently developed energy-type invariant, defined as t...
AbstractIntegral circulant graphs are a generalization of unitary Cayley graphs, recently studied by...
Let Γ=V,E be a graph. If all the eigenvalues of the adjacency matrix of the graph Γ are integers, th...
AbstractA graph G of order n is called hyperenergetic if E(G)>2n-2, where E(G) denotes the energy of...
AbstractIn this note we characterize integral graphs among circulant graphs. It is conjectured that ...
AbstractThis work is based on ideas of Ilić [A. Ilić, The energy of unitary Cayley graphs, Linear Al...
We obtain upper and lower bounds on the average energy of circulant graphs with n vertices and regul...
AbstractWe obtain upper and lower bounds on the average energy of circulant graphs with n vertices a...
From a generalization to $Z^n$ of the concept of congruence we define a family of regular digraphs o...
A graph X is said to be integral if all eigenvalues of the adjacency matrix of X are integers. This...
A graph is called textit{circulant} if it is a Cayley graph on acyclic group, i.e. its adjacency mat...
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. W...
AbstractThe energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. I...
The energy of a graph was introduced by {\sc Gutman} in 1978 as the sum of the absolute values of th...
AbstractThe distance energy of a graph G is a recently developed energy-type invariant, defined as t...
AbstractIntegral circulant graphs are a generalization of unitary Cayley graphs, recently studied by...
Let Γ=V,E be a graph. If all the eigenvalues of the adjacency matrix of the graph Γ are integers, th...
AbstractA graph G of order n is called hyperenergetic if E(G)>2n-2, where E(G) denotes the energy of...
AbstractIn this note we characterize integral graphs among circulant graphs. It is conjectured that ...
AbstractThis work is based on ideas of Ilić [A. Ilić, The energy of unitary Cayley graphs, Linear Al...
We obtain upper and lower bounds on the average energy of circulant graphs with n vertices and regul...
AbstractWe obtain upper and lower bounds on the average energy of circulant graphs with n vertices a...
From a generalization to $Z^n$ of the concept of congruence we define a family of regular digraphs o...
A graph X is said to be integral if all eigenvalues of the adjacency matrix of X are integers. This...