ABSTRACT
This chapter discusses an undirected, connected, simple, finite and non-trivial graph having a vetex set and an edge set. In graph labeling the integers are assigned to a set of vertices or a set of edges or both. The chapter provides information on parity combination cordial labeling, and certain standard graphs obtained using different graph operations on a specific path, cycle and star graph are proved to have parity combination cordial labeling. Coconut Tree is obtained by identifying the apex vertex of the star graph with a pendent vertex of the specific path. Y-tree is obtained from a path by adding an edge to a vertex of a path adjacent to an end point, and m-star is obtained by subdividing each pendent edge of a star graph at specific times.
