Cordial labelings of a Class of Planar Graphs
K. Ramanjaneyulu, Ch . Venkaiah, Kishore Kothapalli · 2009
Let G = (V; E) be a graph and let f: V! f0; 1g be a mapping from the set of vertices to f0; 1g and for each edge (u; v) 2 E assign the label jf(u) f(v)j: If the number of vertices labeled with 0 and the number of vertices labeled with 1 dier by at most 1 and the number of edges labled with 0 and the number of edges labeled with 1 dier by at most 1, then f is called a cordial labeling. In this paper, we present two families of planar graphs, Pln and Plm;n dened shortly, that admit a cordial labeling. We also show that the class Plm;n admits a total product cordial labeling under certain conditions.