Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
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.
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

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 ˟ },...
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 ...
A Novel Method for Developing Post-quantum Digital Signature Algorithms on Non-commutative Associative Algebras
A Novel Method for Developing Post-quantum Digital Signature Algorithms on Non-commutative Associative Algebras
Introduction: Development of practical post-quantum signature algorithms is a current challenge in the area of cryptography. Recently, several candidates on post-quantum signature ...
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...
Post-Quantum Public-Key Cryptoschemes on Finite Algebras
Post-Quantum Public-Key Cryptoschemes on Finite Algebras
One direction in the development of practical post-quantum public-key cryptographic algorithms is the use of finite algebras as their algebraic carrier. Two approaches in this dire...
ATTACHED PRIMES UNDER SKEW POLYNOMIAL EXTENSIONS
ATTACHED PRIMES UNDER SKEW POLYNOMIAL EXTENSIONS
In the author's work [S. A. Annin, Attached primes over noncommutative rings, J. Pure Appl. Algebra212 (2008) 510–521], a theory of attached prime ideals in noncommutative rings wa...

Back to Top