Odd Graceful Labelings of Prism Graphs
Mathematics Exchange · 2025
DOI: 10.33043/yga37vtyebt ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics Exchange, 2025. Verfasst von N. Bradley Fox und 2 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0).
Abstract (Originalsprache)
Odd graceful labelings of a graph are a variation of a graceful labeling. In each, the vertices are uniquely labeled with integers, and edges are assigned the difference between the incident vertex labels. For a graph with m edges, the goal of a graceful labeling is to have distinct edge labels 1 to m, while an odd graceful labeling has odd edge labels from 1 to 2m−1. In this paper we construct odd graceful labelings of prism graphs, denoted Cn×P2, when n is even using the cases of n = 6k,6k+2, and 6k+4, which require similar but altered labelings.
Zitieren
APA
Fox, N. B., Bonney, B., & Patten, S. (2025). Odd Graceful Labelings of Prism Graphs. Mathematics Exchange. https://doi.org/10.33043/yga37vtyebt
Vancouver
Fox NB, Bonney B, Patten S. Odd Graceful Labelings of Prism Graphs. Mathematics Exchange. 2025. doi:10.33043/yga37vtyebt
BibTeX
@article{Fox2025,
author = {Fox, N. Bradley and Bonney, Briauna and Patten, Sage},
title = {Odd Graceful Labelings of Prism Graphs},
journal = {Mathematics Exchange},
year = {2025},
doi = {10.33043/yga37vtyebt}
}
EUVIMED