3-Difference cordial labeling of some path related graphs
Indonesian Journal of Combinatorics · 2018
DOI: 10.19184/ijc.2018.2.1.1 ↗Kurz gefasst
Fachartikel in der Zeitschrift Indonesian Journal of Combinatorics, 2018. Verfasst von R Ponraj und 2 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref).
Abstract (Originalsprache)
Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map where k is an integer 2 ≤ k ≤ p. For each edge uv, assign the label |f(u) − f(v)|. f is called k-difference cordial labeling of G if |vf (i) − vf (j)| ≤ 1 and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labelled with x, ef (1) and ef (0) respectively denote the number of edges labelled with 1 and not labelled with 1. A graph with a k-difference cordial labeling is called a k-difference cordial graph. In this paper we investigate 3-difference cordial labeling behavior of triangular snake, alternate triangular snake, alternate quadrilateral snake, irregular triangular snake, irregular quadrilateral snake, double triangular snake, double quadrilateral snake, double alternate triangular snake, and double alternate quadrilateral snake.
Zitieren
APA
Ponraj, R., Adaickalam, M. M., & Kala, R. (2018). 3-Difference cordial labeling of some path related graphs. Indonesian Journal of Combinatorics. https://doi.org/10.19184/ijc.2018.2.1.1
Vancouver
Ponraj R, Adaickalam MM, Kala R. 3-Difference cordial labeling of some path related graphs. Indonesian Journal of Combinatorics. 2018. doi:10.19184/ijc.2018.2.1.1
BibTeX
@article{Ponraj2018,
author = {Ponraj, R and Adaickalam, M Maria and Kala, R},
title = {3-Difference cordial labeling of some path related graphs},
journal = {Indonesian Journal of Combinatorics},
year = {2018},
doi = {10.19184/ijc.2018.2.1.1}
}
EUVIMED