3-Total Super Product Cordial Labeling For Some Graphs

Abha Tenguria, Rinku Verma

Abstract: In this paper we investigate a new labeling called 3-total super product cordial labeling. Suppose G= (V (G), E (G)) be a graph with vertex set V (G) and edge set E (G). A vertex labeling fV (G) {0, 1, 2}. For each edge uv assign the label (f (u) *f (v)) mod 3. The map f is called a 3-total super product cordial labeling if |f (i) -f (j) |1 for i, j {0, 1, 2} where f (x) denotes the total number of vertices and edges labeled with x={0, 1, 2} and for each edge uv, |f (u) -f (v) |1. Any graph which satisfies 3-total super product cordial labeling is called 3-total super product cordial graphs. Here we prove some graphs like path, cycle and complete bipartite graphk1, n are 3-total super product cordial graphs.

Keywords: 3-total super product cordial labeling, 3-total super product cordial graphs

How to Cite?: Abha Tenguria, Rinku Verma, "3-Total Super Product Cordial Labeling For Some Graphs", Volume 4 Issue 2, February 2015, International Journal of Science and Research (IJSR), Pages: 557-559, https://www.ijsr.net/getabstract.php?paperid=SUB151240, DOI: https://dx.doi.org/10.21275/SUB151240

Download Citation: APA | MLA | BibTeX | EndNote | RefMan