Search

In this paper, we extend our investigation about the generalized comaximal graph introduced in Biswas et al. (Discrete Math Algorithms Appl 11(1):1950013, 2019a). The generalized comaximal graph is defined as follows: given a finite commutative ring R, the generalized comaximal graph G(R) is an undirected graph with its vertex set comprising elements of R and two distinct vertices u, v are adjacent if and only if there exists a non-zero idempotent e ∈ R such that u R + v R = e R . In this study, we focus on identifying the rings R for which the graph G(R) exhibits planarity. Moreover, we provide a characterization of the class of ring for which G(R) is toroidal, denoted by γ (G (R)) = 1 . Furthermore, we also evaluate the energy of the graph G(R). Finally, we demonstrate that the graph G(R) is always Hamiltonian for any finite commutative ring R. [ABSTRACT FROM AUTHOR]

Let R be a commutative ring with 1. In Biswas et al. (Disc Math Algorithms Appl 11(1):1950013, 2019), we introduced a graph G(R) whose vertices are elements of R and two distinct vertices a, b are adjacent if and only if a R + b R = e R for some nonzero idempotent e in R. Let G ′ (R) be the subgraph of G(R) generated by the non-units of R. In this paper, we characterize those rings R for which the graph G ′ (R) is connected and Eulerian. Also we characterize those rings R for which genus of the graph G ′ (R) is ≤ 2 . Finally, we show that the graph G ′ (R) is a line graph of some graph if and only if R is either a regular ring or a local ring. [ABSTRACT FROM AUTHOR]

Two cellular embeddings i: G → S and j: G → S of a connected graph G into a closed orientable surface S are equivalent if there is an orientation-preserving surface homeomorphism h: S → S such that hi = j. The genus polynomial of a graph G is defined by where a is the number of equivalence classes of embeddings of G into the orientable surface S with g genera. In this paper, we compute the genus polynomial of a graph obtained from a cycle by replacing each edge by two multiple edges. [ABSTRACT FROM AUTHOR]