Let G = (V, E) be a graph and let f : V → {0, 1} be a mapping from the set of vertices to {0, 1} and for each edge (u, v) ∈ E assign the label |f(u)− f(v)|. If the number of vertices labeled with 0 and the number of vertices labeled with 1 differ by at most 1 and the number of edges labled with 0 and the number of edges labeled with 1 differ by at most 1, then f is called a cordial labeling. In...

A divisor cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, 3, . . .,|V|} such that if an edge uv is assigned the label 1 if f(u) divides f(v) or f(v) divides f(u) and 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. If a graph has a divisor cordial labeling, then it is called divisor cordial graph. ...

For any integer k > 0, a tree T is k-cordial if there exists a labeling of the vertices of T by Zk, inducing edge-weights as the sum modulo k of the labels on incident vertices to a given edge, which furthermore satisfies the following conditions: 1. Each label appears on at most one more vertex than any other label. 2. Each edge-weight appears on at most one more edge than any other edge-weigh...

In this paper we investigate the pair difference cordial labeling
 behavior of Certain broken wheel graphs.

This papers deals with the Edge cordial labeling of newly introduced eight sprocket graph. graph is already proven as and gracious in labelling. In our study we have further proved that Eight Sprocket related families connected edge-cordial graphs. Also path union graph, cycle star are Edge-cordial.Â