Andere Kunden interessierten sich auch für
![Handbook to Harmonious Labelings of Graphs]( "Handbook to Harmonious Labelings of Graphs")
Handbook to Harmonious Labelings of Graphs26,99 €![Divided Cube Difference Cordial Labeling of Graphs]( "Divided Cube Difference Cordial Labeling of Graphs")
Divided Cube Difference Cordial Labeling of Graphs29,99 €![Group H-Magic Labelings of Graphs]( "Group H-Magic Labelings of Graphs")
Group H-Magic Labelings of Graphs32,99 €![Graceful labelings of Tp-related trees]( "Graceful labelings of Tp-related trees")
Graceful labelings of Tp-related trees51,99 €![TOTAL MAGIC CORDIAL LABELING OF PATH GRAPH]( "TOTAL MAGIC CORDIAL LABELING OF PATH GRAPH")
TOTAL MAGIC CORDIAL LABELING OF PATH GRAPH33,99 €![Fibonacci cordial & 3-equitable labeling]( "Fibonacci cordial & 3-equitable labeling")
Fibonacci cordial & 3-equitable labeling30,99 €![Graceful, Harmonious and Magic Type Labelings]( "Graceful, Harmonious and Magic Type Labelings")
Graceful, Harmonious and Magic Type Labelings37,99 €
In a seminal paper in 1987, I. Cahit introduced cordial labelings. We take G to be a finite, simple, undirected graph with vertex set V and edge set E. Let f be a surjection from the vertex set V to the set {0,1}. This function induces an edge labeling f(u)-f(v) to each edge uv of the graph G. Let v_f (0), v_f (1) denote respectively the number of vertices in G labeled 0 and 1 by f. Let e_f (0), e_f (1) denote respectively the number of edges in G labeled 0 and 1. Then f is called a cordial labeling of G if v_f (0)- v_f (1) 1 and e_f (0)-e_f (1) . A graph G is said to be cordial if it has a cordial labeling. I. Cahit proved that every tree is cordial, all fans are cordial; an Eulerian graph is not cordial if the number of edges e is congruent to 2(mod 4). In this book, we have investigated the cordiality of various types of graphs viz. Corona graphs, t-ply graphs, elongated plys and some wheel related graphs.