# Decomposition Of Various Graphs In To Subtractdivisor Cordial Graphs

Document Type : Primary Research paper

Authors

1 Department of Mathematics, Bannari Amman Institute of Technology, Erode, Tamilnadu.

2 Department of Science and Humanities, Sri Krishna College of Engineering and Technology, Coimbatore, Tamilnadu.

3 Department of Mathematics, M Kumarasamycollege of Engineering, Karur, Tamilnadu. India

Abstract

A subtract divisor cordial labeling of a graph G with vertex set V is a bijection
f :V 1,2,3,...V(G)and the edge labeling : 0,1  f E is defined by   1  f uv , if 2
divides f (u)  f (v) and 0 otherwise. The function f is called a subtractdivisor cordial
labeling if (0)  (1) 1   f f
e e .That is the number of edges labeled with 0 and the number of
edges labeled with 1 differs by at most 1. A graph with a subtract divisor cordial labeling is
called a subtract divisor cordial graph.A decomposition of G is a collection
  S r H ,H ,.....H 1 2   such that i H are edge disjoint and every edges in i H belongs to G . If
each i H is a subtract divisor cordial graphs, then S  is called a subtract divisor cordial
decompositionof G . The minimum cardinality of a subtract divisor cordial decomposition
of G is called the subtract divisor cordial decomposition number of G and it is denoted by
(G). S  In this paper we define subtractdivisor cordialdecomposition and subtract divisor
cordial decomposition number (G) S  of a graphs. Also investigate some bounds of
(G) SUB  in product graphs like Cartesian product, composition etc

Keywords