DUPLICATED GRAPHS: A DEEP DIVE INTO THEIR CORDIALITY

Authors

  • Rajesh Kumar Patil Department of Mathematics, Ponjesly College of Engineering, Nagercoil-629003, Tamil Nadu, India
  • Anjali Priya D'Souza Department of Mathematics, St. Jude’s College, Thoothoor–629176, Kanyakumari, Tamil Nadu, India

Keywords:

Cordial graphs, binary labeling, graph structures, Eulerian graphs, graph theory

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

Downloads

Published

2024-05-01

How to Cite

Patil, R. K., & D'Souza, A. P. (2024). DUPLICATED GRAPHS: A DEEP DIVE INTO THEIR CORDIALITY . Ayden Journal of Intelligent System and Computing, 10(1), 16–26. Retrieved from https://aydenjournals.com/index.php/AJISC/article/view/497

Issue

Vol. 10 No. 1 (2022)

Section

Articles