Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal Indonesian Journal of Combinatorics
Visweswaran, Subramanian
Saurashtra University
Computer Science & IT Decision Sciences, Operations Research & Management

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
When is the maximal graph of a non-quasi-local atomic domain connected? Visweswaran, Subramanian
Indonesian Journal of Combinatorics Vol 8, No 1 (2024)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2024.8.1.4

Abstract

In this paper, with any atomic domain R which admits at least two maximal ideals, we associate an undirected graph denoted by ???(R) whose vertex set is I(R)={Rπ | π∈ Irr(R)\J(R)} (where Irr(R) is the set of all irreducible elements of R and J(R) is the Jacobson radical of R) and distinct Rπ, Rπ' ∈ I(R) are adjacent if and only if Rπ + Rπ' ⊆ M for some maximal ideal M of R. We call ???(R) as the maximal graph of R. We denote the set of all maximal ideals of R by Max(R). In this paper, some necessary (respectively, sufficient) conditions on Max(R) are provided such that ???(R) is connected. Also, in this paper, in some cases, a necessary and sufficient condition is determined so that ???(R) is connected.
Co-Authors