Vertex Magic Reducible Edge Labeling Algorithm for Random Graphs
Huayu Shen, Jingwen Li, Linyu Lan · 2023
In this study, we combine insights from edge-magic labeling and reducible coloring to present a new concept: vertex magic reducible edge labeling. We've devised an algorithm that uses gradual adjustments and optimization techniques to assign labels to a graph's edges. Edges linked to vertices of the same degree have identical labeling sums. The labeling sequence corresponds to a series of natural numbers, with the highest number equaling the graph's edge count. With this methodology, we achieved labeling for up to 100 vertices and derived several theorems and proofs through data analysis.