INVESTIGATING THE CORDIALITY OF DUPLICATED GRAPHS

Abstract

Cordial graph theory has provided valuable insights into graph labeling, particularly through the concept of cordiality. Initially introduced as a weaker alternative to graceful and harmonious graphs, cordial graphs are characterized by {0, 1} binary vertex labeling. This abstract explores various properties of cordial graphs, including the relationship between cordiality and graph structures, such as trees and wheels. Notably, the cordiality of Eulerian graphs is also addressed in connection to its size congruence. While cordial graphs have been a topic of interest, this abstract serves as an introduction to the field and its fundamental results.