[PDF] Top 20 Some New Results on Sum Divisor Cordial Graphs

... of divisor cordial labeling. Vaidya and shah [11] proved that some star and bistars related graphs are divisor cordial ...tree graphs are mean cordial ...Fibonacci ... See full document

... A subdivision of the edge e = uv of a graph G is the replacement of the edge e by a new vertex w and two new edges uw and wv. This operation is also called an elementary subdivision of G. A graph H obtained ... See full document

... A divisor cordial labeling of a graph G with vertex set V vertex G is a bijection f from V to {1, 2, 3, ...a divisor cordial labeling, then it is called divisor cordial ...flower ... See full document

... and some graph operations in Theta graph are sum divisor cordial ...and some graph operations graph namely fusion, duplication, switching of a central vertex, path union of ... See full document

... are sum divisor cordial ...and some graph operations in Theta graph namely fusion, duplication, switching of a central vertex, path union of two copies and the star of Theta graphs are ... See full document

... cordial graphs while K n is not divisor cordial for n ≥ 7 ...The divisor cordial labeling of full binary tree as well as some star related graphs are reported by ... See full document

... prime cordial labeling, Varatharajan et al. [19] introduced a new concept called divisor cordial labeling by combining the divisibility concept in Number theory and Cordial labeling ... See full document

... product cordial if it admits ±1 labeling that satisfies certain conditions ...contribute some new results on signed product cordial labeling and present necessary and sufficient ... See full document

... neighbourhood cordial labeling, if for every vertex v∈V(G), then all the vertices adjacent to the vertex v have the same label and | f(0) – f(1) | ≤ 1, where f(i) denotes sum of the number of vertices and ... See full document

... of cordial labeling of a graph was introduced by Cahit ...product cordial labeling of graph was introduced by Vaidya et ...the sum of the labels around any vertex equals some constant, ... See full document

... prime cordial labeling it is very interesting to investigate graph or graph famili which admit prime cordial ...vestigated some new prime cordial ...similar results for other ... See full document

... Further results on SD-prime cordial graphs were discussed in [6, 7, 8, ...zero-divisor graphs of commutative ring was introduced by ...zero-divisor graphs of commutative ... See full document

... of graphs for which a special set of integer values are assigned to its nodes or edges or both according to some given criteria has been investigated since the middle of the last ...of cordial ... See full document

... of graphs is an active research area and it has been widely studied by several ...of graphs have been applied in the fields such as circuit design, communication network, coding theory, and ... See full document

... of cordial labeling of ...of divisor cordial labeling of graph. The divisor cordial labeling of various types of graph are presented in ... See full document

... A sum divisor cordial labeling of a graph G with vertex set V is a bijection f from V(G) to {1,2,…, |V(G)|} such that an edge uv is assigned the label 1 if 2 divides f(u)+f(v) and 0 otherwise, then ... See full document

... of cordial labeling of ...of divisor cordial labeling of ...a new special type of cordial labeling called square divisor cordial labeling of ...square divisor ... See full document

... of cordial labeling was introduced by Cahit [2] in which he investigated several results on this newly defined ...Also, some new graphs are investigated as product cordial ... See full document

... of cordial labeling of ...of divisor cordial labeling of graphs. The concept of sum divisor cordial labeling was introduced by Lourdusamy et ...product cordial ... See full document

... of graphs subject to certain condition gave raise to enormous work which listed by ...Cube Divisor Cordial Graph were introduced by ...Cube Divisor Cordial Labeling if | (0) − (1)| ≤ ... See full document