Results 1 to 10 of about 37,872 (210)
Orientable Z_n-distance magic labeling of the Cartesian product of many cycles [PDF]
Electronic Journal of Graph Theory and Applications, 2017 The following generalization of distance magic graphs was introduced in [2]. A directed Z_n-distance magic labeling of an oriented graph $\overrightarrow{G}=(V,A)$ of order n is a bijection $\overrightarrow{\ell}\colon V \rightarrow Z_n$ with the ...
Bryan Freyberg, Melissa Keranen
doaj +4 more sources
Group distance magic labeling of the Cartesian product of two directed cycles
Electronic Research ArchiveLet $ \overrightarrow{G} $ be a finite simple directed graph with $ n $ vertices, and let $ \Gamma $ be a finite abelian group of order $ n $. A $ \Gamma $-distance magic labeling is a bijection $ \varphi:V(\overrightarrow{G})\longrightarrow \Gamma $ for
Guixin Deng, Li Wang, Caimei Luo
doaj +4 more sources
Distance Magic Labeling and Two Products of Graphs [PDF]
Graphs and Combinatorics, 2014 Let $$G=(V,E)$$G=(V,E) be a graph of order $$n$$n. A distance magic labeling of $$G$$G is a bijection $$\ell :V\rightarrow \{1,\ldots ,n\}$$ℓ:V→{1,…,n} for which there exists a positive integer $$k$$k such that $$\sum _{x\in N(v)}\ell (x)=k$$∑x∈N(v)ℓ(x ...
Marcin Anholcer +3 more
semanticscholar +8 more sources
Further results on distance magic labeling of graphs
Journal of Mathematical and Computational Science, 2021 Let G=G(V, E) be a graph. If for each vertex v, sum of the labeling of the vertices which are at a distance D from v is constant, then such a labeling is said to be D-distance magic labeling and a graph G is said to be D-distance magic graph.
K. Chaithra, P. Shankaran
semanticscholar +3 more sources
An infinite family of counterexamples to a conjecture on distance magic labeling [PDF]
Experimental MathematicsThis work is about a partition problem which is an instance of the distance magic graph labeling problem. Given positive integers $n,k$ and $p_1\le p_2\le \cdots\le p_k$ such that $p_1+\cdots+p_k=n$ and $k$ divides $\sum_{i=1}^ni$, we study the problem ...
Ehab Ebrahem +2 more
semanticscholar +5 more sources
On zero sum-partition of Abelian groups into three sets and group distance magic labeling
Ars Mathematica Contemporanea, 2017 We say that a finite Abelian group Γ has the constant-sum-partition property into t sets (CSP(t)-property) if for every partition n = r1 +r2 + . . .+rt of n, with ri ≥ 2 for 2 ≤ i ≤ t, there is a partition of Γ into pairwise disjoint subsets A1, A2, . . .
Sylwia Cichacz
semanticscholar +6 more sources
Group distance magic labeling of direct product of graphs
Ars Mathematica Contemporanea, 2014 A distance magic labeling of a graph of order \(n\) is a bijection from the vertex set to \(\{0,1,\dots,n-1\}\) such that the sum of neighbors of any vertex is the same. Magic labellings of graphs have been studied as a generalization of magic squares. A central question has been to identify which graphs admit such labelings.
Marcin Anholcer +3 more
semanticscholar +6 more sources
A Heuristic for Distance Magic Labeling
Procedia Computer Science, 2015 AbstractA distance magic labeling of a graph G with magic constant k is a bijection λ from the V(G) into {1, 2,. . ., |V(G)|}, such that ∑u∈N(v) λ(u) = k for every vertex v. Here we present a heuristic algorithm for finding distance magic graphs and utilise it to find all distance magic graphs with at most 9 vertices.
Fuad Yasin, Rinovia Simanjuntak
semanticscholar +3 more sources
On distance magic labelings of Hamming graphs and folded hypercubes
Discussiones Mathematicae Graph Theory, 2021 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 integer k such that Σx∈N(u) ℓ(x) = k for all vertices u ∈ V, where N(u) is the neighborhood of u.
Štefko Miklavič, Primož Šparl
semanticscholar +4 more sources
Self-reverse labelings of distance magic graphs [PDF]
Bulletin of the Malaysian Mathematical Sciences SocietyA graph is distance magic if it admits a bijective labeling of its vertices by integers from 1 up to the order of the graph in such a way that the sum of the labels of all the neighbors of a vertex is independent of a given vertex.
Petr Kovář +2 more
semanticscholar +6 more sources