[PDF] Top 20 Some Cycle Related 4-cordial Graphs

... Keywords: Abelian group; 4-cordial labeling; middle graph; splitting graph; double wheel; flower graph.. A graph labeling is an assignment of integers to the vertices or edges [r] ... See full document

... product cordial graph and studied certain graphs for this ...prime cordial labeling of graphs. Also we investigate some general results on k- total prime cordial graphs ... See full document

... Graph G (V,E) has L-cordial labeling if there is a bijection function f :E(G)   1 , 2 ,... E  .Thus the vertex label is induced as 0 if the biggest label on the incident edges is even and is induced as 1, if it ... See full document

... prime cordial labeling is called k-total prime cordial ...the 4-total prime cordial labeling of some graphs like Prism, Helm, Dumbbell graph, Sun flower ... See full document

... prime cordial labeling was introduced by Sundaram [5] et ...prime cordial labeling. Vaidya and Vihol [6] have also discussed prime cordial labeling in the context of graph operations while in [7] the ... See full document

... All graphs in this paper are simple finite undirected and nontrivial graph G = (V, E) with vertex set V and the edge set ...standard graphs like Pn, Cn, complete graphs, ladder, lattice grids, ... See full document

... product cordial was introduced by Babujee and Loganathan 3 , they investigated for path graph, cycle graph, star graph and other few ...Kalidass 4 also proved that path union of flower, binary tree ... See full document

... closely related to problems in error correcting codes while odd harmonious labeling is useful to solve undetermined equations as described by Liang and Bai ... See full document

... , Some Special Product Cordial Graphs, Proceeding of the UGC Sponsored National Conference on Advances in Fuzzy Algebra , Fuzzy Topology and Fuzzay Graphs , Journal ENRICH , ISSN 2319-6394, ... See full document

... Cordial labeling was introduced by Cahit ...in cordial such as prime cordial labeling, divisor cordial ...divisor cordial labeling.The divisor cordial labeling of various types ... See full document

... The graphs considered here are finite, connected, undirected and ...Path, Cycle are Fibonacci divisor cordial ...Fibonacci cordial labeling. We have also discussed Fibonacci cordial ... See full document

... notations related to number theory we refer to Burton [2] and graph labeling, we refer to Gallian ...of cordial labeling of ...divisor cordial labeling of graph. The divisor cordial labeling ... See full document

... prime cordial labeling of the graphs such as butterfly graph, W-graph, H-graph and duplication of edges of an ...the graphs such as H ʘ K 1 , path union of r copies of H- graph, cycle union of ... See full document

... Selvaraj, Cycle and Armed Cup cordial graphs, International Journal of Innovative Science, Engineering & Technology , ISSN ...G.Esther, Some Results on Mean ... See full document

... of cordial labeling of graphs. Recently Ponraj et al. [4], introduced the remainder labeling of graphs and investigated the remainder cordial labeling behavior of several graphs ... See full document

... [11] S K Vaidya, G V Ghodasara, Sweta Srivastav, V J Kaneria, “Some new cordial graphs”, Int. J. of scientific comp. 2(1), pp. 81-92, 2008. [12] S K Vaidya, Sweta Srivastav, G V Ghodasara, V J ... See full document

... The first definition of fuzzy graph by Kaufmann was based on Zadeh’s fuzzy relations. After that Rosenfield considered fuzzy relation on fuzzy sets and developed the structure of fuzzy graphs. After the work of ... See full document

... product cordial labeling of graph G, if the induced vertex labeling function defined by the product of labels of incident edges to each vertex is such that the number of edges with label 0 and the number of edges ... See full document

... product cordial labeling was introduced by Sundaram et ...unicyclic graphs of odd order, triangular snakes, dragons, helms and union of two path graphs are product ...≥ 4 is product ... See full document

... Let G be a (p, q) graph. Let k be an integer with 2 ≤ k ≤ p and f from V (G) to the set {1, 2, . . . , k} be a map. For each edge uv, assign the label |f(u) − f(v)|. The function f is called a k -difference ... See full document