Some properties of a graph associated with a non-quasi-local weakly factorial domain and a supergraph of it

Let [Formula: see text] be a weakly factorial domain which admits at least two maximal ideals. We use [Formula: see text] to denote the set of all primary elements of [Formula: see text] and denote [Formula: see text] by [Formula: see text]. Let [Formula: see text]. We denote the subset of [Formula: see text] consisting of all [Formula: see text] such that [Formula: see text] does not belong to the Jacobson radical of [Formula: see text] by [Formula: see text]. With [Formula: see text], in this paper, we associate an undirected graph denoted by [Formula: see text] whose vertex set is [Formula: see text] and distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text]. In Secs. 2 and 3 of this paper, we discuss results regarding the connectedness, the girth, and the clique number of [Formula: see text] and study the interplay between graph properties of [Formula: see text] and the properties of [Formula: see text]. In Secs. 4 and 5 of this paper, we consider a supergraph of [Formula: see text], denoted by [Formula: see text] whose vertex set is [Formula: see text] and distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text] and study some graph properties of [Formula: see text].

Authors

Institutions

Publication Details

Journal
Asian-European Journal of Mathematics
Published
2024-10-25
DOI
https://doi.org/10.1142/s1793557124501249
Citations
1
Primary Topic
Rings, Modules, and Algebras
Type
article
Field-Weighted Citation Impact
1.27
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Some properties of a graph associated with a non-quasi-local weakly factorial domain and a supergraph of it

S. Visweswaran, Premkumar T. Lalchandani
1 citations
Asian-European Journal of Mathematics
Rings, Modules, and Algebras
1.27
article

Some properties of a graph associated with a non-quasi-local weakly factorial domain and a supergraph of it

S. Visweswaran, Premkumar T. Lalchandani
article en
1 citations

Abstract

Let [Formula: see text] be a weakly factorial domain which admits at least two maximal ideals. We use [Formula: see text] to denote the set of all primary elements of [Formula: see text] and denote [Formula: see text] by [Formula: see text]. Let [Formula: see text]. We denote the subset of [Formula: see text] consisting of all [Formula: see text] such that [Formula: see text] does not belong to the Jacobson radical of [Formula: see text] by [Formula: see text]. With [Formula: see text], in this paper, we associate an undirected graph denoted by [Formula: see text] whose vertex set is [Formula: see text] and distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text]. In Secs. 2 and 3 of this paper, we discuss results regarding the connectedness, the girth, and the clique number of [Formula: see text] and study the interplay between graph properties of [Formula: see text] and the properties of [Formula: see text]. In Secs. 4 and 5 of this paper, we consider a supergraph of [Formula: see text], denoted by [Formula: see text] whose vertex set is [Formula: see text] and distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text] and study some graph properties of [Formula: see text].

Asian-European Journal of MathematicsVol. 18(04)
Saurashtra University (IN)
Reduced inequalities
Openalex Percentile: Top 20%
Rings, Modules, and Algebras
1.27
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.