Recent Advancements in Graph Theory

11Some More Parity Combination Cordial Graphs

U. M. Prajapati

St. Xavier’s College,Ahmedabad, Gujarat (INDIA)E-mail: [e-mail]

K. P. Shah

Department of Mathematics,Gujarat University,Ahmedabad, Gujarat (INDIA)E-mail: [e-mail]

For a graph G(V, E), a bijective function f:V→{1,2,…,|V|} is called a parity combination cordial labeling (PCC-labeling) if for each edge uv ∈ E, assigned with label (f(u)f(v)) or (f(v)f(u)) according as f(u) > f(v) or f(v) > f(u) satisfying |e_f(0) − e_f(1)| ≤ 1, where e_f(0) denotes the number of edges labeled with even numbers and e_f(1) denotes the number of edges labeled with odd numbers. The graph satisfying PCC-labeling is called a parity combination cordial graph or PCC-graph. In this chapter, ...