Neighborhood-prime conjecture for unions of cycles with one arbitrary component
Neighborhood-prime conjecture for unions of cycles with one arbitrary component
For positive integers and a positive integer , let denote the cycle graph of length , and let denote disjoint union.
Cycle-union conjecture. The union
is neighborhood-prime if or if is odd.
The conjecture is presented as a consequence that would follow from an affirmative solution of the Deretsky–Lee–Miller prime-labeling conjecture, together with the paper's neighborhood-graph theorem. The source does not report a resolution.
Sources & referencesView supporting material
Primary source
John Asplund, N. Bradley Fox and Arran Hamm, “New Perspectives on Neighborhood-Prime Labelings of Graphs”, arXiv:1804.02473 (2018).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.