2000 character limit reached
Classification of Planar Graphs Associated to the Ideal of the Numerical Semigroup (2012.10434v1)
Published 18 Dec 2020 in math.AC and math.CO
Abstract: Let $\Lambda$ be a numerical semigroup and $I\subset \Lambda$ be an ideal of $\Lambda$. The graph $G_I(\Lambda)$ assigned to an ideal $I$ of $\Lambda$ is a graph with elements of $(\Lambda \setminus I)*$ as vertices and any two vertices $x,y$ are adjacent if and only if $x+y \in I$. In this paper we give a complete characterization (up to isomorphism ) of the graph $G_I(\Lambda)$ to be planar, where $I$ is an irreducible ideal of $\Lambda$. This will finally characterize non planar graphs $G_I(\Lambda)$ corresponding to irreducible ideal $I$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.