A Conjecture for the Clique Number of Graphs Associated with Symmetric Numerical Semigroups of Arbitrary Multiplicity and Embedding Dimension

Abstract

A subset S of non-negative integers No is called a numerical semigroup if it is a submonoid of No and has a finite complement in No. An undirected graph G(S) associated with S is a graph having V(G(S))={vi:i∈No∖S} and E(G(S))={vivj⇔i+j∈S}. In this article, we propose a conjecture for the clique number of graphs associated with a symmetric family of numerical semigroups of arbitrary multiplicity and embedding dimension. Furthermore, we prove this conjecture for the case of arbitrary multiplicity and embedding dimension 7.

Keywords

• symetric numerical semigroup
• multiplicity
• embedding dimension
• gaps
• complete graphs clique number