We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
4-Remainder Cordial Labeling Graphs Obtained From Ladder.
- Authors
R., Ponraj; K., Annathurai; R., Kala
- Abstract
Let G be a (p, q) graph. Let f be a map from V (G) to the set {1, 2, · · ·, k} where k is an integer 2 < k ≤ |V (G)|. For each edge uv assign the label r where r is the remainder when f(u) is divided by f(v) (or) f(v) is divided by f(u) according as f(u) ≥ f(v) or f(v) ≥ f(u). The function f is called a k-remainder cordial labeling of G if |vf (i) - vf (j)| ≤ 1, i, j ∈ {1, · · ·, k} where vf (x) denote the number of vertices labelled with x and |ef (0) - ef (1)| ≤ 1 where ef (0) and ef (1) respectively denote the number of edges labeled with even integers and number of edges labelled with odd integers. A graph with a k-remainder cordial labeling is called a k-remainder cordial graph. In this paper we investigate the 4-remainder cordial labeling behavior of Ln ⊙ K1, Ln ⊙ 2K1, Ln ⊙ K2, and some ladder related graphs, where G1 ⊙ G2 denotes the corona of G1 with G2.
- Subjects
GRAPH labelings; GEOMETRIC vertices; INTEGERS; LABELS
- Publication
International Journal of Mathematical Combinatorics, 2018, Vol 4, p114
- ISSN
1937-1055
- Publication type
Article