Answers are grounded in this paper and cite their sources.
Analysis shows diameter and girth of bipartite graphs using numerical semigroups, indicating new computational methods.
In this article, a correspondence between some important classes of numerical semigroups and well-known families of bipartite graphs has been established. Also, it has been demonstrated that, if m(S) is the multiplicity of a numerical semigroup S, then the diameter and the girth of bipartite gap poset graphs are bounded by the numbers 2m(S)−3 and m(S)−1, respectively. Moreover, the Python code to compute the diameter and girth of gap poset graphs has been implemented.
No takes yet. Share an insight, caveat, or question.
Mehtab et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: