Prime Labelings of Snake Graphs
Keywords:
graphs, graph labelings, prime labelings, cycles
Abstract
A prime labeling of a graph G with n vertices is a labeling of the vertices with distinct integers from the set {1, 2 ,..., n} such that the labels of any two adjacent vertices are relatively prime. In this paper, we introduce a snake graph, the fused union of identical cycles, and define a consecutive snake prime labeling for this new family of graphs. We characterize some snake graphs that have a consecutive snake prime labeling and then consider a variation of this labeling.
Published
2019-08-21
How to Cite
Bigham, A., Donovan, E. A., Pack, J., Turley, J., & Wiglesworth, L. (2019). Prime Labelings of Snake Graphs. The PUMP Journal of Undergraduate Research, 2, 131-149. https://doi.org/10.46787/pump.v2i0.1274
Section
Articles
Copyright (c) 2019 Abigail Bigham, Elizabeth Ann Donovan, James Pack, Jordan Turley, Lesley Wiglesworth
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
The author(s) will retain the copyright, but by submitting the article agree to grant permission to the PUMP Journal of Undergraduate Research to publish, distribute, and archive the article. The author(s) will acknowledge prior publication in the PUMP Journal of Undergraduate Research for all future uses of the article or parts of it.