Edge magic total labeling of lexicographic product C4(2r+1) o ~K2 cycle with chords, unions of paths, and unions of cycles and paths
Indonesian Journal of Combinatorics · 2018
DOI: 10.19184/ijc.2018.2.2.6 ↗Kurz gefasst
Fachartikel in der Zeitschrift Indonesian Journal of Combinatorics, 2018. Verfasst von Inne Singgih. Die Arbeit wurde bisher 1-mal zitiert (Crossref).
Abstract (Originalsprache)
An edge magic total (EMT) labeling of a graph G = (V, E) is a bijection from the set of vertices and edges to a set of numbers defined by λ : V ∪ E → {1, 2, ..., ∣V∣ + ∣E∣} with the property that for every xy ∈ E, the weight of xy equals to a constant k, that is, λ(x) + λ(y) + λ(xy) = k for some integer k. In this paper given the construction of an EMT labeling for certain lexicographic product $C_{4(2r+1)}\circ \overline{K_2}$, cycle with chords [c]tCn, unions of paths mPn, and unions of cycles and paths m(Cn1(2r + 1) ∪ (2r + 1)Pn2).
Zitieren
APA
Singgih, I. (2018). Edge magic total labeling of lexicographic product C4(2r+1) o ~K2 cycle with chords, unions of paths, and unions of cycles and paths. Indonesian Journal of Combinatorics. https://doi.org/10.19184/ijc.2018.2.2.6
Vancouver
Singgih I. Edge magic total labeling of lexicographic product C4(2r+1) o ~K2 cycle with chords, unions of paths, and unions of cycles and paths. Indonesian Journal of Combinatorics. 2018. doi:10.19184/ijc.2018.2.2.6
BibTeX
@article{Singgih2018,
author = {Singgih, Inne},
title = {Edge magic total labeling of lexicographic product C4(2r+1) o ~K2 cycle with chords, unions of paths, and unions of cycles and paths},
journal = {Indonesian Journal of Combinatorics},
year = {2018},
doi = {10.19184/ijc.2018.2.2.6}
}
EUVIMED