Graceful labeling on torch graph
Indonesian Journal of Combinatorics · 2018
DOI: 10.19184/ijc.2018.2.1.2 ↗Kurz gefasst
Fachartikel in der Zeitschrift Indonesian Journal of Combinatorics, 2018. Verfasst von Jona Martinus Manulang und 1 weiteren Autor:innen.
Abstract (Originalsprache)
Let G be a graph with vertex set V=V(G) and edge set E=E(G). An injective function f:V --> {0,1,2,...,|E|} is called graceful labeling if f induces a function f*(uv)=|f(u)-f(v)| which is a bijection from E(G) to the set {1,2,3,...,|E|}. A graph which admits a graceful labeling is called a graceful graph. In this paper, we show that torch graph On is a graceful graph.
Zitieren
APA
Manulang, J. M., & Sugeng, K. A. (2018). Graceful labeling on torch graph. Indonesian Journal of Combinatorics. https://doi.org/10.19184/ijc.2018.2.1.2
Vancouver
Manulang JM, Sugeng KA. Graceful labeling on torch graph. Indonesian Journal of Combinatorics. 2018. doi:10.19184/ijc.2018.2.1.2
BibTeX
@article{Manulang2018,
author = {Manulang, Jona Martinus and Sugeng, Kiki A.},
title = {Graceful labeling on torch graph},
journal = {Indonesian Journal of Combinatorics},
year = {2018},
doi = {10.19184/ijc.2018.2.1.2}
}
EUVIMED