@article {
author = {Vinothkumar, N and Preethi, N and Nivethitha, K},
title = {Decomposition Of Various Graphs In To Subtractdivisor Cordial Graphs},
journal = {Int. J. of Aquatic Science},
volume = {12},
number = {2},
pages = {2858-2868},
year = {2021},
publisher = {},
issn = {2008-8019},
eissn = {2008-8019},
doi = {},
abstract = {A subtract divisor cordial labeling of a graph G with vertex set V is a bijectionf :V 1,2,3,...V(G)and the edge labeling : 0,1 f E is defined by 1 f uv , if 2divides f (u) f (v) and 0 otherwise. The function f is called a subtractdivisor cordiallabeling if (0) (1) 1 f fe e .That is the number of edges labeled with 0 and the number ofedges labeled with 1 differs by at most 1. A graph with a subtract divisor cordial labeling iscalled 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 . Ifeach i H is a subtract divisor cordial graphs, then S is called a subtract divisor cordialdecompositionof G . The minimum cardinality of a subtract divisor cordial decompositionof 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 divisorcordial decomposition number (G) S of a graphs. Also investigate some bounds of(G) SUB in product graphs like Cartesian product, composition etc},
keywords = {Subtract divisor cordial,subtract divisor cordial decomposition and subtract divisor cordial decomposition number},
url = {https://www.journal-aquaticscience.com/article_134352.html},
eprint = {https://www.journal-aquaticscience.com/article_134352_d11114ff2222ac6bcac2a1c7ff095f0f.pdf}
}