ABSTRACT
This chapter introduces A-cordial labeling for an abelian group as a simultaneous generalization of cordial and harmonious labeling. It discusses Klein-four group and also proves some of a set of ladder and book related graphs with admit V4-cordial labeling. The chapter proves that book graph, Mobius ladder, open ladder and Mongolian tent are V4-cordial graphs. It considers a finite, connected, undirected and simple graph with specific total number of vertices and specific total number of edges provided corresponding to the vertices. A graph labeling is regarded as an assignment of numbers to the vertices or edges or both subject to a certain condition.
