Some Problems in Cordial Labelings of Graphs
Samina Boxwala
Broschiertes Buch

Some Problems in Cordial Labelings of Graphs

Versandkostenfrei!
Versandfertig in 6-10 Tagen
34,99 €
inkl. MwSt.
PAYBACK Punkte
17 °P sammeln!
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 co...