Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal Indonesian Journal of Combinatorics
M Maria Adaickalam
Department of Economics and Statistics District Statistical office, Ramanathapuram-623501, India
Computer Science & IT Decision Sciences, Operations Research & Management

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
3-Difference cordial labeling of some path related graphs R Ponraj; M Maria Adaickalam; R Kala
Indonesian Journal of Combinatorics Vol 2, No 1 (2018)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (234.96 KB) | DOI: 10.19184/ijc.2018.2.1.1

Abstract

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.
Co-Authors R Kala R Ponraj