Results 11 to 20 of about 29,335 (219)
Distance magic labeling on shadow graphs [PDF]
AIP Conference Proceedings, 2022 C. Subin Krishna, Shankaran Perikamana
openalex +2 more sources
Distance Magic Labeling of Generalised Mycielskian Graphs [PDF]
, 2023 In this paper, we have studied the distance magic labelling of Generalised Mycielskian of a few families of graphs.
Ravindra Pawar, Tarkehswar Singh
openalex +3 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
Magic labelings of distance at most 2 [PDF]
, 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 +3 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 product graphs [PDF]
, 2017 21 pages, the Second Malta Conference in Graph Theory and ...
Rinovia Simanjuntak +1 more
openalex +3 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 +2 more sources
Further results on distance magic labeling of graphs
Journal of Mathematical and Computational Science, 2021 openalex +2 more sources
Examples of distance magic labelings of the $6$-dimensional hypercube [PDF]
, 2021 A distance magic labeling of an $n$-dimensional hypercube is a labeling of its vertices by natural numbers from $\{0, \ldots, 2^n-1\}$, such that for all vertices $v$ the sum of the labels of the neighbors of $v$ is the same. Such a labeling is called neighbor-balanced, if, moreover, for each vertex $v$ and an index $i=0,\ldots,n-1$, exactly half of ...
Petr Savický
openalex +3 more sources
$k$-Distance Magic Labeling and Long Brush Graphs [PDF]
, 2022 We define a labeling $f:$ $V(G)$ $\rightarrow$ $\{1, 2, \ldots, n\}$ on a graph $G$ of order $n \geq 3$ as a \emph{$k$-distance magic} ($k$-DM) if $\sum_{w\in \partial N_k(u)}{ f(w)}$ is a constant and independent of $u\in V(G)$ where $\partial N_k(u)$ = $\{v\in V(G): d(u, v) = k\}$, $k\in\mathbb{N}$. Graph $G$ is called a \emph{$k$-DM} if it has a $k$-
V. Vilfred Kamalappan
openalex +3 more sources