AbstractThis work is based on ideas of Ilić [A. Ilić, The energy of unitary Cayley graphs, Linear Algebra Appl. 431 (2009) 1881–1889] on the energy of unitary Cayley graph. For a finite commutative ring R with unity 1≠0, the unitary Cayley graph of R is the Cayley graph whose vertex set is R and the edge set is {{a,b}:a,b∈Randa-b∈R×}, where R× is the group of units of R. We study the eigenvalues of the unitary Cayley graph of a finite commutative ring and some gcd-graphs and compute their energy. Moreover, we obtain the energy for the complement of unitary Cayley graphs
Naj bo $K$ končen komutativen kolobar z enico $1 ne 0$. Cayleyjev graf končnega kolobarja $K$ je gra...
Let \({E}_{n}\) be the ring of Eisenstein integers modulo \(n\). We denote by \(G({E}_{n})\) and \(G...
A graph is called textit{circulant} if it is a Cayley graph on acyclic group, i.e. its adjacency mat...
AbstractThis work is based on ideas of Ilić [A. Ilić, The energy of unitary Cayley graphs, Linear Al...
ABSTRACT: Let R be a finite commutative ring with unity 1 6 = 0. The restricted unitary Cayley graph...
AbstractA graph G of order n is called hyperenergetic if E(G)>2n-2, where E(G) denotes the energy of...
Let G be a vertex colored graph. The minimum number χ(G) of colors needed for coloring of a graph G ...
Let G be a vertex colored graph. The minimum number χ(G) of colors needed for coloring of a graph G ...
AbstractMotivated by an open problem of Abawajy et al. [1] we find some relations between power grap...
In this note we obtain the energy of unitary Cayley graph X-n which extends a result of R. Balakrish...
Let En be the ring of Eisenstein integers modulo n. We denote by G(En) and GEn, the unit graph and t...
AbstractIf X is a commutative ring with unity, then the unitary Cayley graph of X, denoted GX, is de...
In this paper we introduce mixed unitary Cayley graph $M_{n}$ $(n>1)$ and compute its eigenval...
Abstract. A graph is called circulant if it is a Cayley graph on a cyclic group, i.e. its adjacency ...
Abstract. In this paper we explore structural properties of unitary Cayley graphs, including clique ...
Naj bo $K$ končen komutativen kolobar z enico $1 ne 0$. Cayleyjev graf končnega kolobarja $K$ je gra...
Let \({E}_{n}\) be the ring of Eisenstein integers modulo \(n\). We denote by \(G({E}_{n})\) and \(G...
A graph is called textit{circulant} if it is a Cayley graph on acyclic group, i.e. its adjacency mat...
AbstractThis work is based on ideas of Ilić [A. Ilić, The energy of unitary Cayley graphs, Linear Al...
ABSTRACT: Let R be a finite commutative ring with unity 1 6 = 0. The restricted unitary Cayley graph...
AbstractA graph G of order n is called hyperenergetic if E(G)>2n-2, where E(G) denotes the energy of...
Let G be a vertex colored graph. The minimum number χ(G) of colors needed for coloring of a graph G ...
Let G be a vertex colored graph. The minimum number χ(G) of colors needed for coloring of a graph G ...
AbstractMotivated by an open problem of Abawajy et al. [1] we find some relations between power grap...
In this note we obtain the energy of unitary Cayley graph X-n which extends a result of R. Balakrish...
Let En be the ring of Eisenstein integers modulo n. We denote by G(En) and GEn, the unit graph and t...
AbstractIf X is a commutative ring with unity, then the unitary Cayley graph of X, denoted GX, is de...
In this paper we introduce mixed unitary Cayley graph $M_{n}$ $(n>1)$ and compute its eigenval...
Abstract. A graph is called circulant if it is a Cayley graph on a cyclic group, i.e. its adjacency ...
Abstract. In this paper we explore structural properties of unitary Cayley graphs, including clique ...
Naj bo $K$ končen komutativen kolobar z enico $1 ne 0$. Cayleyjev graf končnega kolobarja $K$ je gra...
Let \({E}_{n}\) be the ring of Eisenstein integers modulo \(n\). We denote by \(G({E}_{n})\) and \(G...
A graph is called textit{circulant} if it is a Cayley graph on acyclic group, i.e. its adjacency mat...