Distance magic labeling of the halved folded n-cube

Yi Tian, Na Kang, Weili Wu, Ding-Zhu Du and Suogang Gao ()
Additional contact information
Yi Tian: Hebei Normal University
Na Kang: Hebei GEO University
Weili Wu: University of Texas at Dallas
Ding-Zhu Du: University of Texas at Dallas
Suogang Gao: Hebei Normal University

Journal of Combinatorial Optimization, 2023, vol. 45, issue 2, No 21, 13 pages

Abstract: Abstract Hypercube is an important structure for computer networks. The distance plays an important role in its applications. In this paper, we study a magic labeling of the halved folded n-cube which is a variation of the n-cube. This labeling is determined by the distance. Let G be a finite undirected simple connected graph with vertex set V(G), distance function $$\partial $$ ∂ and diameter d. Let $$D\subseteq \{0,1,\dots ,d\}$$ D ⊆ { 0 , 1 , ⋯ , d } be a set of distances. A bijection $$l:V(G)\rightarrow \{1,2,\dots ,|V(G)|\}$$ l : V ( G ) → { 1 , 2 , ⋯ , | V ( G ) | } is called a D-magic labeling of G whenever $$\sum \limits _{x\in G_D(v)}l(x)$$ ∑ x ∈ G D ( v ) l ( x ) is a constant for any vertex $$v\in V(G)$$ v ∈ V ( G ) , where $$G_D(v)=\{x\in V(G): \partial (x,v)\in D\}$$ G D ( v ) = { x ∈ V ( G ) : ∂ ( x , v ) ∈ D } . A $$\{1\}$$ { 1 } -magic labeling is also called a distance magic labeling. We show that the halved folded n-cube has a distance magic labeling (resp. a $$\{0,1\}$$ { 0 , 1 } -magic labeling) if and only if $$n=16q^2$$ n = 16 q 2 (resp. $$n=16q^2+16q+6$$ n = 16 q 2 + 16 q + 6 ), where q is a positive integer.

Keywords: D-magic labeling; Distance-regular graph; Halved folded n-cube; Network; Incomplete tournament (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-023-01008-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:45:y:2023:i:2:d:10.1007_s10878-023-01008-7

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-023-01008-7

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().