Results 11 to 20 of about 1,491 (176)
On distance magic labelings of Hamming graphs and folded hypercubes
Discussiones Mathematicae Graph TheorySummary: Let \(\Gamma =(V,E)\) be a graph of order \(n\). A distance magic labeling of \(\Gamma\) is a bijection \(\ell \colon V \to \{1,2, \ldots, n\}\) for which there exists a positive integer \(k\) such that \(\sum_{x \in N(u)} \ell(x) = k\) for all vertices \(u \in V\), where \(N(u)\) is the neighborhood of \(u\).
Štefko Miklavič, Primoz Šparl
doaj +5 more sources
On 14-regular distance magic graphs [PDF]
Electronic Journal of Graph Theory and ApplicationsLet G be a graph with n vertices. By N(v) we denote the set of all vertices adjacent to v. A bijection f : V(G)→{1, 2, …, n} is a distance magic labeling of G if there exists an integer k such that the sum of labels of all vertices adjacent to v is k for
Petr Kovář, Matěj Krbeček
doaj +5 more sources
Classification of tetravalent distance magic circulant graphs
Discrete Mathematics, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stefko Miklavic, Primoz Šparl
exaly +3 more sources
Constant Sum Partition of Sets of Integers and Distance Magic Graphs
Discussiones Mathematicae Graph Theory, 2018 Let A = {1, 2, . . . , tm+tn}. We shall say that A has the (m, n, t)-balanced constant-sum-partition property ((m, n, t)-BCSP-property) if there exists a partition of A into 2t pairwise disjoint subsets A1, A2, . . . , At, B1, B2, . . .
Cichacz Sylwia, Gőrlich Agnieszka
doaj +5 more sources
DISTANCE MAGIC GRAPHS - A SURVEY [PDF]
Journal of the Indonesian Mathematical Society, 2012 Let <i>G = (V;E)</i> be a graph of order n. A bijection <i>f : V → {1, 2,...,n} </i>is called <i>a distance magic labeling </i>of G if there exists a positive integer k such that <i>Σ f(u) = k </i> for all <i>v ε V</i>, where <i>N(v)</i> is the open ...
S. Arumugam +2 more
openaire +2 more sources
Note on group distance magicness on product graphs
Contributions to Discrete Mathematics, 2021 If $l$ is a bijection from the vertex set $V(G)$ of a graph $G$ to an additive abelian group $\Gamma$ of $|V(G)|$ elements such that for any vertex $u$ of $G$, the weight $\sum_{v\in N_{G}(u)}l(v)$ is $\mu$, where $\mu \in \Gamma$, then $l$ is a $\Gamma$-distance magic labeling of $G$.
Prajeesh, Appattu Vallapil +1 more
openaire +4 more sources
Spectra of graphs and closed distance magic labelings
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
exaly +3 more sources
Handicap Labelings of 4-Regular Graphs
Advances in Electrical and Electronic Engineering, 2017 Let G be a simple graph, let f : V(G)→{1,2,...,|V(G)|} be a bijective mapping. The weight of v ∈ V(G) is the sum of labels of all vertices adjacent to v. We say that f is a distance magic labeling of G if the weight of every vertex is the same
Petr Kovar +3 more
doaj +3 more sources
A note on Distance Magic and Distance antimagic graphs
Electronic Notes in Discrete Mathematics, 2015 Abstract Let G = ( V , E ) be a graph of order n. The graph G is said to be distance magic if there exists a bijection f : V ( G ) → { 1 , 2 , … , n } such that for all v ∈ V , w ( v ) = ∑ u ∈ N ( v ) f ( u ) is a constant, called vertex magic constant.
A Ramalakshmi, S Arumugam
exaly +2 more sources
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 +2 more sources