Work

Investigating the Amicability of Replicated Graphs

Year: 2024

Type: article

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.

Source: Zenodo (CERN European Organization for Nuclear Research)

DOI: 10.5281/zenodo.14514120

Authors: Michael, W. Smith, Aisha K., Patel

Institution: University of Cape Town

Language: English

Topic: Graph Labeling and Dimension Problems

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W6949626588

FWCI:

Cites:

Cited by:

Related to: