Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Energy of unitary cayley graphs and GCD-Graphs
View through CrossRef
This work is based on ideas of Ilic on the energy of unitary Cayley graph. We study the eigenvalues of the unitary Cayley graph of a finite commutative ring and some gcd-graphs and compute their energy. Moreover, we apply these results to obtain the energy of the complement of unitary Cayley graphs and of the restricted unitary Cayley graphs on quadratic residues.
Title: Energy of unitary cayley graphs and GCD-Graphs
Description:
This work is based on ideas of Ilic on the energy of unitary Cayley graph.
We study the eigenvalues of the unitary Cayley graph of a finite commutative ring and some gcd-graphs and compute their energy.
Moreover, we apply these results to obtain the energy of the complement of unitary Cayley graphs and of the restricted unitary Cayley graphs on quadratic residues.
Related Results
On sums involving divisor function, Euler's totient function, and floor function
On sums involving divisor function, Euler's totient function, and floor function
Every positive integer $l \in \mathbb{N}$ can be formed $l = (m + n)d$, provided $gcd(m,n)=1$. From this point of view, the next formulas $n=\sum_{d|l} \varphi(d)$ and $\frac{n(n+1...
On sums involving divisor function, Euler's totient function, and floor function
On sums involving divisor function, Euler's totient function, and floor function
Every positive integer $l \in \mathbb{N}$ can be formed $l = (m + n)d$, provided $gcd(m,n)=1$. From this point of view, the next formulas $n=\sum_{d|l} \varphi(d)$ and $\frac{n(n+1...
On sums involving divisor function, Euler's totient function, and floor function
On sums involving divisor function, Euler's totient function, and floor function
Every positive integer $l \in \mathbb{N}$ can be formed $l = (m + n)d$, provided $gcd(m,n)=1$. From this point of view, the next formulas $n=\sum_{d|l} \varphi(d)$ and $\frac{n(n+1...
On sums involving divisor function, Euler's totient function, and floor function
On sums involving divisor function, Euler's totient function, and floor function
Every positive integer $l \in \mathbb{N}$ can be formed $l = (m + n)d$, provided $gcd(m,n)=1$. From this point of view, the next formulas $n=\sum_{d|l} \varphi(d)$ and $\frac{n(n+1...
The Cayley Isomorphism Property for Cayley Maps
The Cayley Isomorphism Property for Cayley Maps
The Cayley Isomorphism property for combinatorial objects was introduced by L. Babai in 1977. Since then it has been intensively studied for binary relational structures: graphs, d...
Finite edge-transitive Cayley graphs and rotary Cayley maps
Finite edge-transitive Cayley graphs and rotary Cayley maps
This paper aims to develop a theory for studying Cayley graphs, especially for those with a high degree of symmetry. The theory consists of analysing several types of basic Cayley ...
Cayley graphs and cayley Signed graphs over finite commutative rings
Cayley graphs and cayley Signed graphs over finite commutative rings
Let R be a finite commutative ring with identity1≠0. The unitary Cayley graph of R, denoted by Gr, is the graph whose vertex set is R and the edge set {{a,b} : a,bϵR and a-bϵR ˟ },...
Roughness in Fuzzy Cayley Graphs
Roughness in Fuzzy Cayley Graphs
Rough set theory is a worth noticing approach for inexact and uncertain system modelling. When rough set theory accompanies with fuzzy set theory, which both are a complementary ge...