[PDF] Top 20 Product Cordial Graph in the Context of Some Graph Operations on Gear Graph

... f V → such that each edge uv is assigned the label f u f v ( ) ( ) , the number of vertices with label 0 and the number of vertices with label 1 differ by atmost 1 and the number of edge with label 0 and the number of ... See full document

... a graph G = ( V G ( ) ( ) , E G ) , a function f : E G ( ) { } → 0 ,1 is called an edge product cordial labeling of G, if the induced vertex labeling function is defined by the product of the ... See full document

... prime cordial labeling of theta ...prime cordial labeling in the context of some graph operations namely duplication, witching, fusion, path union and the graph obtained ... See full document

... not product cordial.Vaidya and Barasara[9],[10],[11],[12]discuss product cordiality of closed helms, web graphs, ower graphs, double triangular snakes obtained from the path Pn if and only if n is odd, and ... See full document

... investigated product cordial labeling for shadow graph of cycle Cn ...friendship graph and the middle graph of path admit product cordial labeling while the same authors ... See full document

... signed product cordial labeling of gear graph, flower graph, sunflower graph, cobweb graph and lotus inside a ...flower graph as well as sunflower graph ... See full document

... edge product cordial graph it is essential to assign label 0 to 2n edges out of 4n ...this context, the edges with label 0 will give rise to at least n + 2 vertices with label 0 and at most n ... See full document

... Graph theory has seen an explosive growth due to interaction with areas like computer science, operation research, etc. In particular, it has become one of the most powerful mathematical tools in the analysis and ... See full document

... Let G be a graph with minimum degree at least one. A total dominator coloring of G is a proper coloring of G with the extra property that every vertex in G properly dominates a color class. The total dominator ... See full document

... labeling 0110 0110...0110 (repeated r-times). In most cases, we then modify this by adding symbols at one end or the other (or both); Similarly *+ 101 denotes the labeling 0011 0011...0011 101 for one cycle of the ... See full document

... short. The readers can refer to [9] for standard graph theoretic concepts and terms used but undefined in this paper. In this paper, we determine the PI index for some special graphs. The organization of ... See full document

... Harrary, 1969). All the graphs considered here are simple, finite, and non-trivial. denote the number of vertices and edges of a degree of a vertex in is is called a cut vertex if removing increases the number of ... See full document

... are cordial. Further, they proved that, the cycle C n is cordial if and only if n  2(mod 4) , the wheel W n is cordial if and only if n  3(mod 4) , n  3 ...wheel graph and complement of ... See full document

... Line graph L(G) of G has the edges of G as its vertices and two vertices of L(G) are adjacent if and only if they are adjacent in ...Line graph L(G) and also Hamiltonian-t*-laceability of Line graph ... See full document

... a graph means a collection of points and lines connecting a subset of ...a graph also called vertices and edges of the graph, ...connected graph is a graph such that there is a path ... See full document

... A graph ( , ) is of vertices and ...Divisor Cordial Graph were introduced by ...simple graph and ∶ ( ) → 1, 2, … , | ( )| be a ...Divisor Cordial Labeling if | (0) − (1)| ≤ ...admits ... See full document

... Clearly it has 2m+6 vertices and 2m+7 edges. Definition 2.4 Mean labeling: A graph G with p vertices and q edges is called a mean graph if there is an injective function f : v  { 0 , 1 , 2 ,..., q } such ... See full document

... 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

... divisor cordial and proved the graphs such as path, cycle, wheel, star and some complete bipartite graphs are divisor cordial graphs and in [12], they proved some special classes of graphs ... See full document

... total product cordial labeling of a graph G with vertex set V is a function f from V to {0, 1} such that if each edge uv is assigned a label f(u) f(v), the number of vertices and edges labeled with 0 ... See full document