Classification of Planar Graphs Associated to the Ideal of the Numerical Semigroup
arXiv:2012.10434
Abstract
Let be a numerical semigroup and be an ideal of . The graph assigned to an ideal of is a graph with elements of as vertices and any two vertices are adjacent if and only if . In this paper we give a complete characterization (up to isomorphism ) of the graph to be planar, where is an irreducible ideal of . This will finally characterize non planar graphs corresponding to irreducible ideal .