Results 1 to 10 of about 126 (83)
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
Spectra of graphs and closed distance magic labelings [PDF]
Discrete Mathematics, 2016 Let $G=(V,E)$ be a graph of order $n$. A closed distance magic labeling of $G$ is a bijection $\ell \colon V(G)\rightarrow \{1,\ldots ,n\}$ for which there exists a positive integer $k$ such that $\sum_{x\in N[v]}\ell (x)=k$ for all $v\in V $, where $N[v]$ is the closed neighborhood of $v$.
Marcin Anholcer +2 more
openalex +3 more sources
Distance magic labelings of Cartesian products of cycles [PDF]
Discrete MathematicsA graph of order $n$ is distance magic if it admits a bijective labeling of its vertices with integers from $1$ to $n$ such that each vertex has the same sum of the labels of its neighbors. In this paper we classify all distance magic Cartesian products of two cycles, thereby correcting an error in a widely cited paper from 2004.
Ksenija Rozman, Primož Šparl
+5 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 of characterizing the cases where it is possible to find a partition of the set $\{1,2,\ldots,n ...
Ehab Ebrahem +2 more
+6 more sources
Distance Magic Labeling and Two Products of Graphs [PDF]
Graphs and Combinatorics, 2014 Let $G=(V,E)$ be a graph of order $n$. A distance magic labeling of $G$ is a bijection $\ell \colon V\rightarrow {1,...,n}$ for which there exists a positive integer $k$ such that $\sum_{x\in N(v)}\ell (x)=k$ for all $v\in V $, where $N(v)$ is the neighborhood of $v$. We introduce a natural subclass of distance magic graphs. For this class we show that
Marcin Anholcer +3 more
openalex +5 more sources
Orientable Group Distance Magic Labeling of Directed Graphs [PDF]
Mathematical Problems in Engineering, 2022 A directed graph G is said to have the orientable group distance magic labeling if there exists an abelian group ℋ and one-one map ...
Wasim Ashraf +2 more
openalex +2 more sources
On distance magic labelings of Hamming graphs and folded hypercubes
Discussiones Mathematicae Graph Theory, 2021 Bibliografija: str. 32-33.
Štefko Miklavič, Primož Šparl
openalex +5 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
openalex +3 more sources
Magic labelings of distance at most 2
, 2013 For an arbitrary set of distances $D\subseteq \{0,1, \ldots, d\}$, a graph $G$ is said to be $D$-distance magic if there exists a bijection $f:V\rightarrow \{1,2, \ldots , v\}$ and a constant {\sf k} such that for any vertex $x$, $\sum_{y\in N_D(x)} f(y) ={\sf k}$, where $N_D(x) = \{y \in V| d(x,y) \in D\}$.
Rinovia Simanjuntak +4 more
openalex +4 more sources
Distance magic labelings of product graphs
, 2017 21 pages, the Second Malta Conference in Graph Theory and ...
Rinovia Simanjuntak +1 more
openalex +4 more sources