In this paper, we prove that wheel, closed helm, quadrilateral snake, double quadrilateral snake and gear graphs are sum cordial graphs.

No abstract

A cube divisor cordial labeling of a graph G with vertex set3 |f (u) and the label 0 otherwise, then |e f (0) − e f (1)| ≤ 1. A graph which admits a cube divisor cordial labeling is called a cube divisor cordial graph. In this paper we discuss cube divisor cordial labeling of some standard graphs such as path, cycle, wheel, flower and fan.