D-DISTANCE MAGIC LABELING ON REGULAR GRAPHS
Global and Stochastic Analysis · 2026
DOI: 10.64837/gsa.13.5.9 ↗Kurz gefasst
Fachartikel in der Zeitschrift Global and Stochastic Analysis, 2026. Verfasst von CHAITHRA K.
Abstract (Originalsprache)
Distance-based labeling is an important area in graph theory due to its applications in coding theory, network design, communication systems, and related areas. A D-distance magic labeling (D-DML) of a graph G with n vertices is a bijection f : V (G) → {1, 2, . . . , n} such that, for every vertex v ∈ V (G), w(v) = X u∈ND(v) f(u) is a constant, say k, which is called the magic constant, where ND(v) = {u ∈ V (G) : d(u, v) ∈ D}. In this paper, I study D-distance magic labeling (D-DML) of simple undirected regular graphs for a distance set D ⊆ {1, 2, . . . , d}, where d is the diameter of the graph G. I investigate D-DML of disjoint unions of cycles, complete graphs, and r-regular graphs. In addition, I investigate D-DML of non-isomorphic regular graphs.
Zitieren
APA
K, C. (2026). D-DISTANCE MAGIC LABELING ON REGULAR GRAPHS. Global and Stochastic Analysis. https://doi.org/10.64837/gsa.13.5.9
Vancouver
K C. D-DISTANCE MAGIC LABELING ON REGULAR GRAPHS. Global and Stochastic Analysis. 2026. doi:10.64837/gsa.13.5.9
BibTeX
@article{K2026,
author = {K, CHAITHRA},
title = {D-DISTANCE MAGIC LABELING ON REGULAR GRAPHS},
journal = {Global and Stochastic Analysis},
year = {2026},
doi = {10.64837/gsa.13.5.9}
}
EUVIMED