Uniformly cordial graphs Original Research Article

Let image be a graph with vertex set image and edge set image. A labeling image induces an edge labeling image, defined by image for each edge image. For image, let image and image. Let image. A labeling image of a graph image is called friendly if image. A cordial labeling of image is a friendly labeling image for which image. A graph image is a uniformly cordial graph if every friendly labeling of image is cordial. It is shown that a connected graph image of order image is uniformly cordial if and only if image and image, or image is even and image.