EUVIMEDEUVIMED entdecken
Crossref

On Regular Distance Magic Graphs of Odd Order

Adam Silber, Petr Kovář, Pavla Kabelíková–Hrušková, Michal Kravčenko

Journal of Combinatorial Mathematics and Combinatorial Computing · 2023

DOI: 10.61091/jcmcc117-06 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Combinatorial Mathematics and Combinatorial Computing, 2023. Verfasst von Adam Silber und 3 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Let G=(V,E) be a graph with n vertices. A bijection f:V→{1,2,…,n} is called a distance magic abeling f G if there exists an integer k such that ∑u∈N(v)f(u)=k for all v∈V, where N(v) is the set of all ertices adjacent to v. Any graph which admits a distance magic labeling is a distance magic graph. The existence of regular distance magic graphs of even order was solved completely in a paper by ronček, Kovář, and Kovářová. In two recent papers, the existence of 4-regular and of (n−3)-regular distance magic graphs of odd order was also settled completely. In this paper, we provide a similar classification of all feasible odd orders of r-regular distance magic graphs when r=6,8,10,12. Even though some nonexistence proofs for small orders are done by brute force enumeration, all the existence proofs are constructive.

Zitieren

APA

Silber, A., Kovář, P., Kabelíková–Hrušková, P., & Kravčenko, M. (2023). On Regular Distance Magic Graphs of Odd Order. Journal of Combinatorial Mathematics and Combinatorial Computing. https://doi.org/10.61091/jcmcc117-06

Vancouver

Silber A, Kovář P, Kabelíková–Hrušková P, Kravčenko M. On Regular Distance Magic Graphs of Odd Order. Journal of Combinatorial Mathematics and Combinatorial Computing. 2023. doi:10.61091/jcmcc117-06

BibTeX
@article{Silber2023,
  author = {Silber, Adam and Kovář, Petr and Kabelíková–Hrušková, Pavla and Kravčenko, Michal},
  title = {On Regular Distance Magic Graphs of Odd Order},
  journal = {Journal of Combinatorial Mathematics and Combinatorial Computing},
  year = {2023},
  doi = {10.61091/jcmcc117-06}
}
Kostenlos starten →