When is the maximal graph of a non-quasi-local atomic domain connected?

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

Authors

Institutions

Publication Details

Journal
Indonesian Journal of Combinatorics
Published
2024-09-26
DOI
https://doi.org/10.19184/ijc.2024.8.1.4
Primary Topic
Synthesis of Tetrazole Derivatives
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

When is the maximal graph of a non-quasi-local atomic domain connected?

S. Visweswaran
Indonesian Journal of Combinatorics
Synthesis of Tetrazole Derivatives
article

When is the maximal graph of a non-quasi-local atomic domain connected?

S. Visweswaran
article en

Abstract

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

Indonesian Journal of CombinatoricsVol. 8(1)
Saurashtra University (IN)
Openalex Percentile: Top 88%
Synthesis of Tetrazole Derivatives
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.