REVIEW 1 cited by
Minimum coprime graph labelings
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
A coprime labeling of a graph $G$ is a labeling of the vertices of $G$ with distinct integers from $1$ to $k$ such that adjacent vertices have coprime labels. The minimum coprime number of $G$ is the least $k$ for which such a labeling exists. In this paper, we determine the minimum coprime number for several well-studied classes of graphs, including the coronas of complete graphs with empty graphs and the joins of two paths. In particular, we resolve a conjecture of Seoud, El Sonbaty, and Mahran and two conjectures of Asplund and Fox. We also provide an asymptotic for the minimum coprime number of the Erd\H{o}s-R\'enyi random graph.
Forward citations
Cited by 1 Pith paper
-
Minimum Coprime Labelings of Generalized Petersen and Prism Graphs
The paper proves exact minimum coprime numbers for all generalized Petersen graphs GP(n,2), for stacked triangular and pentagonal prisms, and for a degree-two Petersen variant, while conjecturing the value for odd prisms.
Discussion (0). Continue with ORCID to comment.