CORDIAL LABELING OF DEGREE SPLITTING GRAPHS

2015 | Volume : 1 | Issue 2

S. K. Vaidya and N. H. Shah

Saurashtra University

Abstract : A binary vertex labeling is called a cordial labeling if the number of vertices with labels 0 and 1 differs by at most 1 as well as the number of edges with labels 0 and 1 differs by at most 1. We prove some results on cordial labeling of graphs in the c

Keywords : Cordial labeling, degree splitting graph, path.

MSC Numbers : 05C78


Article PreviewView Full Article

Go Back
Designed by Asort Technologies