• ON 4-PRODUCT CORDIAL GRAPHS
Abstract
Let f be a map from V(G) to{0,1,...k-1}where k is an integer,
For each edge uv assign the label f(u)f(v)(mod k). f is called a k- Product cordial labeling if and ,i,j {0,1,..k-1},
where and denote the number of vertices and edges respectively labelled with x (x=0,1,2,3...k-1). We investigate the 4-Product cordial labeling behaviour of some standard graphs.
For each edge uv assign the label f(u)f(v)(mod k). f is called a k- Product cordial labeling if and ,i,j {0,1,..k-1},
where and denote the number of vertices and edges respectively labelled with x (x=0,1,2,3...k-1). We investigate the 4-Product cordial labeling behaviour of some standard graphs.
Keywords
Let f be a map from V(G) to{0,1,...k-1}where k is an integer, For each edge uv assign the label f(u)f(v)(mod k). f is called a k- Product cordial labeling if and ,i,j {0,1,..k-1}, where and denote the number of vertices and edges respectively labe
Full Text:
PDF
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
| © 2010-2022 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |