Odd Graceful Labeling of W -Tree W T ( n , k ) and its Disjoint Union
Utilitas Mathematica · 2024
DOI: 10.61091/um118-05 ↗Kurz gefasst
Fachartikel in der Zeitschrift Utilitas Mathematica, 2024. Verfasst von Abaid ur Rehman Virk und 1 weiteren Autor:innen.
Abstract (Originalsprache)
Let G=(V(G),E(G)) be a graph with p vertices and q edges. A graph G of size q is said to be odd graceful if there exists an injection λ:V(G)→0,1,2,…,2q−1 such that assigning each edge xy the label or weight |λ(x)–λ(y)| results in the set of edge labels being 1,3,5,…,2q−1. This concept was introduced in 1991 by Gananajothi. In this paper, we examine the odd graceful labeling of the W-tree, denoted as WT(n,k).
Zitieren
APA
Virk, A. U. R., & Riasat, A. (2024). Odd Graceful Labeling of W -Tree W T ( n , k ) and its Disjoint Union. Utilitas Mathematica. https://doi.org/10.61091/um118-05
Vancouver
Virk AUR, Riasat A. Odd Graceful Labeling of W -Tree W T ( n , k ) and its Disjoint Union. Utilitas Mathematica. 2024. doi:10.61091/um118-05
BibTeX
@article{Virk2024,
author = {Virk, Abaid ur Rehman and Riasat, A.},
title = {Odd Graceful Labeling of W -Tree W T ( n , k ) and its Disjoint Union},
journal = {Utilitas Mathematica},
year = {2024},
doi = {10.61091/um118-05}
}
EUVIMED