Abstract

Graph labeling is an assignment of integers to vertices or edges of a graph or both subject to a certain condition. The concept of cordial labeling was introduced by Cahit [3] in 1987. Let $ f $ be a function from the vertices of $G$ to ${(0,1)}$ and for each edge $xy$ assigns the label $ |f(x)-f(y)| $. We call $ f $ a cordial labeling of $G$ if the number of vertices labeled 0 and the number of vertices labeled 1 differ at most by 1, and the number of edges labeled 0 and the number of edges labeled 1 differ at most by 1. A graph which admits cordial labeling is called a cordial graph. In this paper, we prove the cordial labeling of a new class of graphs.

Keywords and Phrases

Cordial labeling, tadpole graph, $k$ -polygonal snake graph.

A.M.S. subject classification

05C78.

.....