Javascript must be enabled to continue!
BALANCED UNITARY CAYLEY SIGRAPHS OVER FINITE COMMUTATIVE RINGS
View through CrossRef
Let R be a finite commutative ring with identity 1. 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×}, where R× is the group of units of R. We define the unitary Cayley signed graph (or unitary Cayley sigraph in short) to be an ordered pair ????R = (GR, σ), where GR is the unitary Cayley graph over R with signature σ : E(GR) → {1, -1} given by [Formula: see text] In this paper, we give a criterion on R for SR to be balanced (every cycle in ????R is positive) and a criterion for its line graph L(????R) to be balanced. We characterize all finite commutative rings with the property that the marked sigraph ????R,μ is canonically consistent. Moreover, we give a characterization of all finite commutative rings where ????R, η(????R) and L(????R) are hyperenergetic balanced.
World Scientific Pub Co Pte Lt
Title: BALANCED UNITARY CAYLEY SIGRAPHS OVER FINITE COMMUTATIVE RINGS
Description:
Let R be a finite commutative ring with identity 1.
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×}, where R× is the group of units of R.
We define the unitary Cayley signed graph (or unitary Cayley sigraph in short) to be an ordered pair ????R = (GR, σ), where GR is the unitary Cayley graph over R with signature σ : E(GR) → {1, -1} given by [Formula: see text] In this paper, we give a criterion on R for SR to be balanced (every cycle in ????R is positive) and a criterion for its line graph L(????R) to be balanced.
We characterize all finite commutative rings with the property that the marked sigraph ????R,μ is canonically consistent.
Moreover, we give a characterization of all finite commutative rings where ????R, η(????R) and L(????R) are hyperenergetic balanced.
Related Results
On isomorphisms of m-Cayley digraphs
On isomorphisms of m-Cayley digraphs
The isomorphism problem for digraphs is a fundamental problem in graph theory. This problem for Cayley digraphs has been extensively investigated over the last half a century. In t...
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 ˟ },...
Effects of cleaning in Saturn's rings
Effects of cleaning in Saturn's rings
Saturn's rings are well known for many good reasons, one of them being their brightness. Made of almost 99% water ice, they are by far the most ice-rich object of the solar system,...
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...
Energy of unitary cayley graphs and GCD-Graphs
Energy of unitary cayley graphs and GCD-Graphs
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...
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 ...
Determinants of some special matrices over commutative finite chain rings
Determinants of some special matrices over commutative finite chain rings
AbstractCirculant matrices over finite fields and over commutative finite chain rings have been of interest due to their nice algebraic structures and wide applications. In many ca...
On the Commutative Operation of Approximate CMOS Ripple Carry Adders (RCAs)
On the Commutative Operation of Approximate CMOS Ripple Carry Adders (RCAs)
<p>Approximate cells can be used to design Ripple Carry Adders (RCAs) for realizing approximate addition in energy-efficient CMOS digital circuits. As inputs of approximate c...

