[PDF] Top 20 H and H2 Cordial Labeling of Some Graphs

... of H-cordial labeling. [1] calls a graph H-cordial if it is possible to label the edges with the numbers from the set   1, 1  in such a way that, for some k, at each vertex v ... See full document

... Vaidya and Shah [10] proved that, some star and bistar related graphs are divisor cordial graphs. Duplication of vertices and edges was introduced by Vaidya and Barasara [9] and they applying ... See full document

... graph labeling, we refer to Gallian [4]. The notion of prime labeling for graphs originated with Roger Entringer and was introduced in a paper by Tout et ... See full document

... vertex labeling f of a graph G is called a total 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) | ≤ ... See full document

... intersection cordial la- beling of a graph G with vertex set V is an injection f from V to the power set of { 1, 2, ...intersection cordial labeling, then it is called intersection cordial ... See full document

... graph labeling can be found in Gallian ...graph labeling. According to Beineke and Hegde [2] graph labeling serves as a frontier between number theory and structure of ... See full document

... k-difference cordial labeling is called a k-difference cordial ...3-difference cordial labeling of wheel, helms, flower graph, sunflower graph, lotus inside a circle, closed helm, and ... See full document

... graph labeling, we refer to Gallian ...of cordial labeling of graph. The concept of product cordial labeling of a graph was introduced by Sundaram ...product cordial ... See full document

... – Cordial Labeling (LCL) was introduced in ...of some standard graphs. Prime cordial, Cube difference and Square difference labeling of H- related graphs has been ... 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 ...product cordial ... See full document

... sum cordial labeling for union of some ...sum cordial labeling if for where denotes the total number of vertices and edges labeled with and for each edge ...sum cordial ... See full document

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

... of labeling. The concept of labeling of graphs is an active research area and it has been widely studied by several ...the labeling technique plays a vital role to label the cables. The ... See full document

... of labeling. The concept of labeling of graphs is an active research area and it has been widely studied by several ...the labeling technique plays a vital role to label the cables. The ... See full document

... The graphs considered here are finite, connected, undirected and ...divisor cordial graph. A dynamic survey of graph labeling is published and updated every year by ...Fibonacci cordial ... See full document

... All graphs G = ( V ( G ) , E ( G )) in this paper are finite, connected and ...graph labeling. A dynamic survey on graph labeling is regularly updated by Gallian ...Labeled graphs have variety ... See full document

... Zero-M-Cordial labeling is defined in [2]. A labeling f of a graph G is called Zero-M-Cordial, if for each vertex v, f(v) = ...an H- Cordial labeling for a given graph G. ... See full document

... graph labeling, we refer to Gallian ...of cordial labeling of ...divisor cordial labeling of graph. The divisor cordial labeling of various types of graph are presented in ... See full document

... magic cordial (TMC) labeling is due to Cahit [2] as a modification of edge-magic total labeling and cordial ...magic cordial labeling with constant C if there exists a mapping f ... 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 ...different labeling problems ... See full document