Journal of Algorithms and Computation
Open Access

A note on 3-Prime cordial graphs

Document Type : Research Paper

Authors

R. Ponraj 1
Rajpal Singh 2
S. Sathish Narayanan 1

1 Department of Mathematics, Sri Paramakalyani College,Alwarkurichi-627412, India

2 Research Scholar, Department of Mathematics Manonmaniam Sundaranar University, Tirunelveli-627012, India

https://doi.org/10.22059/jac.2016.7939
Abstract
Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1. A graph with a k-prime cordial labeling is called a k-prime cordial graph. In this paper we investigate 3- prime cordial labeling behavior of union of a 3-prime cordial graph and a path Pn.

Keywords

Path
union of graphs
Journal of Algorithms and Computation
Volume 48, Issue 1 - Serial Number 1
December 2016
Pages 45-55

Home

Guide for Authors

Submit Manuscript

Reviewers

Contact Us