The conception of magic labeling in fuzzy graphs elongates to fuzzy vertex magic labeling together with consecutive non-integer values in (0, 1] and the graph's�...

Abstract Let Γ = (V, E) be a graph of order n. A distance magic labeling of Γ is a bijection ℓ: V → {1, 2, . . ., n} for which there exists a positive�...

A folded hypercube is a graph obtained from a hypercube by identifying pairs of vertices at maximal distance. We classify distance magic folded hypercubes by�...

On distance magic labelings of Hamming graphs and folded hypercubes ... Miklavic S., Sparl P. Expand. Publication type: Journal Article.

In this paper, we will study D-magic labelings of the halved n-cube ( n ≥ 2 ) that is on all binary strings of length n with even number of 1s as vertices and�...

Feb 17, 2022 � [6] Š. Miklavic, P. Šparl, On distance magic labelings of Hamming graphs and folded hypercubes, Discuss. Math. Graph Theory, in press.

[主题词]：distance magic graph; distance magic labeling; folded hypercube; Hamming graph ; [作者]：Štefko Miklavič; Primoz Šparl ; [期刊]：�...

A distance magic labeling of a graph G is a bijective assignment of labels from {1, 2, …, |V (G)|} to the vertices of G such that the sum of labels on�...

A distance magic labeling of a graph G is a bijective assignment of labels from {1, 2, …, |V (G)|} to the vertices of G such that the sum of labels on�...

Mar 7, 2023 � 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�...