Cordial labelling of Cactus Graphs
Nasreen Khan, Madhumangal Pal · 2013
Suppose = ( , ) G V E be a graph with vertex set V and edge set E . A vertex labelling : {0,1} f V → induces an edge labelling * : {0,1} f E → . For {0,1} i∈ , let ( ) f v i and ( ) f e i be the number of vertices v and edges e with ( ) = f v i and ( ) = f e i respectively. A graph is cordial if there exists a vertex labelling f such that | (0) (1) | 1 f f v v − ≤ and | (0) (1) | 1 f f e e − ≤ . In this paper, we label the vertices of cactus graph by cordial labelling and have shown that cactus graph is cordial under some restrictions.