The rings considered in this article are commutative with identity. This article is motivated by the work on comaximal graphs of rings.  In this article, with any ring $R$, we associate an undirected graph denoted by $G(R)$, whose vertex set is the set of all elements of $R$ and distinct vertices $x,y$ are joined by an edge in $G(R)$ if and only if $Rxcap Ry = Rxy$.  In Section 2 of this articl...

The perfect 1-factorization conjecture by A. Kotzig [7] asserts the existence of a 1-factorization of a complete graph K2n in which any two 1-factors induce a Hamiltonian cycle. This conjecture is one of the prominent open problems in graph theory. Apart from its theoretical significance it has a number of applications, particularly in designing topologies for wireless communication. Recently, ...

Subshifts of finite type are sets of colorings of the plane defined by local constraints. They can be seen as a discretization of continuous dynamical systems. We investigate here the hardness of deciding factorization, conjugacy and embedding of subshifts of finite type (SFTs) in dimension d > 1. In particular, we prove that the factorization problem is Σ3-complete and that the conjugacy and e...

let $r$ be a commutative ring with identity‎. ‎we use‎ ‎$varphi (r)$ to denote the comaximal ideal graph‎. ‎the vertices‎ ‎of $varphi (r)$ are proper ideals of r which are not contained‎ ‎in the jacobson radical of $r$‎, ‎and two vertices $i$ and $j$ are‎ ‎adjacent if and only if $i‎ + ‎j = r$‎. ‎in this paper we show some‎ ‎properties of this graph together with planarity of line graph‎ ‎assoc...

This paper proposes a geometric solution to the problem of prime decomposability of concurrent processes first explored by R. Milner and F. Moller in [MM93]. Concurrent programs are given a geometric semantics using cubical areas, for which a unique factorization theorem is proved. An effective factorization method which is correct and complete with respect to the geometric semantics is derived...

In this paper, we define a new concept of factorization for a bounded bilinear mapping $f:Xtimes Yto Z$, depended on  a natural number $n$ and a cardinal number $kappa$; which is called $n$-factorization property of level $kappa$. Then we study the relation between $n$-factorization property of  level $kappa$ for $X^*$ with respect to $f$ and automatically boundedness and $w^*$-$w^*$-continuity...