Results 11 to 20 of about 200 (157)
Examples of distance magic labelings of the $6$-dimensional hypercube
, 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 +4 more sources
$k$-Distance Magic Labeling and Long Brush Graphs
, 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 +4 more sources
Distance Magic Labeling of Generalised Mycielskian Graphs
, 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 +4 more sources
Distance Magic Labeling in Complete 4-partite Graphs [PDF]
Graphs and Combinatorics, 2015 Let $G$ be a complete $k$-partite simple undirected graph with parts of sizes $p_1\le p_2...\le p_k$. Let $P_j=\sum_{i=1}^jp_i$ for $j=1,...,k$. It is conjectured that $G$ has distance magic labeling if and only if $\sum_{i=1}^{P_j} (n-i+1)\ge j{{n+1}\choose{2}}/k$ for all $j=1,...,k$.
Daniel Kotlar
openalex +4 more sources
Group distance magic labeling of direct product of graphs
Ars Mathematica Contemporanea, 2014 Let G = ( V , E ) be a graph and Γ an Abelian group, both of order n . A group distance magic labeling of G is a bijection l: V → Γ for which there exists μ ∈ Γ such that ∑ x ∈ N ( v ) l( x ) = μ for all v ∈ V , where N ( v ) is the neighborhood of v .
Marcin Anholcer +3 more
openalex +3 more sources
A magic-angle-spinning NMR method for H1–H1 distance measurement using coherent polarization transfer in C13-labeled organic solids [PDF]
The Journal of Chemical Physics, 2008 We have developed a theory for H1–H1 distance measurements from the direct polarization transfer in C13-labeled solids under magic-angle spinning. The polarization transfer caused by the H1–H1 dipolar interactions was analyzed with zeroth-order average Hamiltonian for a H1–C13–C13–H1 spin system in the frame modulated by C13–H1 dipolar interactions and
Hiroki Takahashi +2 more
openalex +4 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 = r 1 + r 2 + … + r t of n , with r i ≥ 2 for 2 ≤ i ≤ t , there is a partition of Γ into pairwise disjoint subsets A 1 , A 2 , …, A t , such that ∣ A i ∣ = r i
Sylwia Cichacz
openalex +4 more sources
Distance Magic Labeling of Corona Product of Graphs
InPrime: Indonesian Journal of Pure and Applied MathematicsLet G = (V, E) is a graph with order n, and f: V(G) → {1,2,...,n} is a bijection. For any vertex v ϵ V, the sum of f(u) is called the weight of vertex v, denoted by w(v), where N(v) is the set of neighbors of vertex v. If the labeling f satisfies that there exists a constant k such that w(v)=k, for every vertex v in the graph G, then f is called a ...
Christyan Tamaro Nadeak
openalex +2 more sources
Ars Mathematica Contemporanea, 2019 Corrigendum to the paper: S. Cichacz, On zero sum-partition of Abelian groups into three sets and group distance magic labeling, Ars Math. Contemp. 13 (2017), 417–425, doi: 10.26493/1855-3974.1054.fcd .
Sylwia Cichacz
openalex +3 more sources
Distance magic labeling on shadow graphs [PDF]
AIP Conference Proceedings, 2022 C. Subin Krishna, Shankaran Perikamana
openalex +2 more sources