Int. J. of Aquatic Science2008-801912220210601Decomposition Of Various Graphs In To Subtractdivisor Cordial Graphs28582868134352ENNVinothkumarDepartment of Mathematics, Bannari Amman Institute of Technology, Erode, Tamilnadu.NPreethiDepartment of Science and Humanities, Sri Krishna College of Engineering and
Technology, Coimbatore, Tamilnadu.KNivethithaDepartment of Mathematics, M Kumarasamycollege of Engineering, Karur, Tamilnadu.
IndiaJournal Article20210729A subtract divisor cordial labeling of a graph G with vertex set V is a bijection<br />f :V 1,2,3,...V(G)and the edge labeling : 0,1 f E is defined by 1 f uv , if 2<br />divides f (u) f (v) and 0 otherwise. The function f is called a subtractdivisor cordial<br />labeling if (0) (1) 1 f f<br />e e .That is the number of edges labeled with 0 and the number of<br />edges labeled with 1 differs by at most 1. A graph with a subtract divisor cordial labeling is<br />called a subtract divisor cordial graph.A decomposition of G is a collection<br /> S r H ,H ,.....H 1 2 such that i H are edge disjoint and every edges in i H belongs to G . If<br />each i H is a subtract divisor cordial graphs, then S is called a subtract divisor cordial<br />decompositionof G . The minimum cardinality of a subtract divisor cordial decomposition<br />of G is called the subtract divisor cordial decomposition number of G and it is denoted by<br />(G). S In this paper we define subtractdivisor cordialdecomposition and subtract divisor<br />cordial decomposition number (G) S of a graphs. Also investigate some bounds of<br />(G) SUB in product graphs like Cartesian product, composition etchttp://www.journal-aquaticscience.com/article_134352_d11114ff2222ac6bcac2a1c7ff095f0f.pdf