On Connectedness, Girth and Diameter of Gap Poset Graphs

In this article, we introduce the graphs associated with gap posets of numerical semigroups. We prove that gap poset graphs are either bipartite graphs or graphs with girth 3. Also, we characterize gap poset graphs in terms of connectedness, girth and diameter.

Authors

Institutions

Publication Details

Journal
Proceedings of the Bulgarian Academy of Sciences
Published
2025-06-29
DOI
https://doi.org/10.7546/crabs.2025.06.03
Citations
1
Primary Topic
Graph Labeling and Dimension Problems
Type
article
Field-Weighted Citation Impact
1.50

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On Connectedness, Girth and Diameter of Gap Poset Graphs

Hasan Mahmood, Amal S. Alali, Muhammad Ahsan Binyamin, Adeel
1 citations
Proceedings of the Bulgarian Academy of Sciences
Graph Labeling and Dimension Problems
1.50
article

On Connectedness, Girth and Diameter of Gap Poset Graphs

Hasan Mahmood, Amal S. Alali, Muhammad Ahsan Binyamin, Adeel
article en
1 citations

Abstract

In this article, we introduce the graphs associated with gap posets of numerical semigroups. We prove that gap poset graphs are either bipartite graphs or graphs with girth 3. Also, we characterize gap poset graphs in terms of connectedness, girth and diameter.

Proceedings of the Bulgarian Academy of SciencesVol. 78(6)
Princess Nourah bint Abdulrahman University (SA), Government College University, Lahore (PK)
Princess Nourah Bint Abdulrahman University
Openalex Percentile: Top 15%
Graph Labeling and Dimension Problems
1.50
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.