Document Type : Research Paper

Authors

• R. Ponraj
• S. Sathish Narayanan

Department of Mathematics, Sri Paramakalyani College,Alwarkurichi-627 412, India

Abstract

A graph G = (V,E) with p vertices and q edges is said to be a total mean cordial graph if there exists a function f : V (G) → {0, 1, 2} such that f(xy) = [(f(x)+f(y))/2] where x, y ∈ V (G), xy ∈ E(G), and the total number of 0, 1 and 2 are balanced. That is |ev_f (i) − ev_f (j)| ≤ 1, i, j ∈ {0, 1, 2} where ev_f (x) denotes the total number of vertices and edges labeled with x (x = 0, 1, 2). In this paper, we investigate the total mean cordial labeling of C_n², ladder L_n, book B_m and some more graphs.

Keywords

• cycle
• Path
• union of graphs
• Star
• ladder