当前位置:
X-MOL 学术
›
Discret. Math.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Classification of tetravalent distance magic circulant graphs
Discrete Mathematics ( IF 0.8 ) Pub Date : 2021-07-22 , DOI: 10.1016/j.disc.2021.112557 Štefko Miklavič 1, 2, 3 , Primož Šparl 1, 3, 4
中文翻译:
四价距离幻循环图的分类
更新日期:2021-07-22
Discrete Mathematics ( IF 0.8 ) Pub Date : 2021-07-22 , DOI: 10.1016/j.disc.2021.112557 Štefko Miklavič 1, 2, 3 , Primož Šparl 1, 3, 4
Affiliation
Let be a graph of order n. A distance magic labeling of Γ is a bijection for which there exists a positive integer k such that for all vertices , where is the neighborhood of u. A graph is said to be distance magic if it admits a distance magic labeling.
In this paper we classify all connected tetravalent distance magic circulants, that is Cayley graphs where for some with . As a consequence we solve an open problem posed by Cichacz and Froncek.
中文翻译:
四价距离幻循环图的分类
让 是n阶图。甲距离魔标记Γ的是一个双射存在一个正整数k使得 对于所有顶点 , 在哪里 是u的邻域。如果一个图允许距离魔法标记,则称其为距离魔法。
在本文中,我们对所有连通的四价距离魔术循环进行分类,即凯莱图 在哪里 对于一些 和 . 因此,我们解决了 Cichacz 和 Froncek 提出的一个开放问题。