| Abstract |
In this talk, we will discuss the concept of graceful labeling and extend it to graceful antimagic labeling for different types of graphs, including trees and also discuss some well-known examples like the Petersen graph. We use Python to create algorithms that help us to understand these unique labels and how they work. Also, we will characterize graceful local antimagic labeling for some families of graphs.
|
