Graceful Local Antimagic Labeling of Graphs: A Pattern Analysis Using Python

Graph labeling is the process of assigning labels to vertices and edges under certain conditions. This paper investigates the graceful local antimagic labeling of various graph families, excluding symmetric labelings, using computational experiments and Python-based algorithms. Through these experim...

Full description

Saved in:
Bibliographic Details
Published inSymmetry (Basel) Vol. 17; no. 1; p. 108
Main Authors Alam, Luqman, Semaničová-Feňovčíková, Andrea, Popa, Ioan-Lucian
Format Journal Article
LanguageEnglish
Published Basel MDPI AG 01.01.2025
Subjects
Algorithms
Apexes
Graph theory
Graphs
Labeling
Labels
Pattern analysis
Trees
Online AccessGet full text
ISSN2073-8994
2073-8994
DOI10.3390/sym17010108

Cover

More Information
Summary:Graph labeling is the process of assigning labels to vertices and edges under certain conditions. This paper investigates the graceful local antimagic labeling of various graph families, excluding symmetric labelings, using computational experiments and Python-based algorithms. Through these experiments, we identify new results and patterns within specific graph classes. The study expands on the existing literature by offering computational evidence, proposing algorithms for the verification of labelings, and exploring the relationship between the local antimagic labeling and the chromatic number. Our results increase the understanding of graph labeling and offer insights into its computational aspects.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2073-8994
2073-8994
DOI:10.3390/sym17010108