On the intersection ideal graph of semigroups
Barkha Baloda, Jitender Kumar

TL;DR
This paper studies the intersection ideal graph of semigroups, analyzing its connectivity, diameter, and other graph properties, and classifies semigroups based on these features, including automorphism groups.
Contribution
It provides a comprehensive analysis of the intersection ideal graph of semigroups, including connectivity, diameter classification, and automorphism group determination.
Findings
If the intersection ideal graph is connected, its diameter is at most 2.
Classified semigroups with diameter exactly two.
Determined automorphism groups for semigroups composed of minimal left ideals.
Abstract
The intersection ideal graph of a semigroup is a simple undirected graph whose vertices are all nontrivial left ideals of and two distinct left ideals are adjacent if and only if their intersection is nontrivial. In this paper, we investigate the connectedness of . We show that if is connected then . Further we classify the semigroups such that the diameter of their intersection graph is two. Other graph invariants, namely perfectness, planarity, girth, dominance number, clique number, independence number etc. are also discussed. Finally, if is union of minimal left ideals then we obtain the automorphism group of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Rings, Modules, and Algebras · Scheduling and Optimization Algorithms
