Results 181 to 190 of about 29,335 (219)

Distance magic labelings of hypercubes

open access: closedElectronic Notes in Discrete Mathematics, 2013
Abstract A distance magic labeling of a graph G is a bijective assignment of labels from {1, 2, …, |V (G)|} to the vertices of G such that the sum of labels on neighbors of u is the same for all vertices u. We show that the n-dimensional hypercube has a distance magic labeling for every n ≡ 2 ( mod 4 ) . It is known that this condition is
Petr Gregor, Petr Kovář
openalex   +2 more sources

Characterize group distance magic labeling of Cartesian product of two cycles

open access: closedDiscrete Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zeng Xiang-neng, Guixin Deng, Caimei Luo
openalex   +3 more sources

Distance Magic and Distance Antimagic Labeling of Some Product Graphs

open access: closed, 2020
Distance magic graph admits a distance magic labeling, whereas the distance antimagic graph admits a distance antimagic labeling. This chapter discusses the existence of distance magic labeling and distance antimagic labeling for a specific function. It considers that all graphs with a specific vertex set and a specific edge set are finite and simple ...
N P Shrimali, Y M Parmar
openalex   +2 more sources

Group distance magic labeling of tetravalent circulant graphs

open access: closedDiscrete Applied Mathematics, 2023
Let \(G = (V , E)\) be a finite simple graph of order \(n\) and let \(\Gamma\) be an abelian group of order \(n\). A \(\Gamma\)-distance magic labeling of \(G\) is a bijection \(\varphi :V\rightarrow \Gamma\) for which there exits \(\gamma \in \Gamma\) such that \(\Sigma_{x \in N(V)} \varphi(x)=\gamma\) for any \(v \in V\), where \(N(v)\) is the ...
Guixin Deng, Geng Jin, Xiangneng Zeng
openalex   +2 more sources

A $$\varGamma $$-magic Rectangle Set and Group Distance Magic Labeling

open access: closed, 2015
A \(\varGamma \)-distance magic labeling of a graph \(G = (V, E)\) with \(|V| = n\) is a bijection \(\ell \) from V to an Abelian group \(\varGamma \) of order n such that the weight \(w(x) =\sum _{y\in N_G(x)}\ell (y)\) of every vertex \(x \in V\) is equal to the same element \(\mu \in \varGamma \) called the magic constant.
Sylwia Cichacz
openalex   +2 more sources

Note on the Group Distance Magic Labeling of Direct Product of Two Cycles

open access: closedBulletin of the Iranian Mathematical Society
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guixin Deng   +3 more
openalex   +3 more sources

On distance magic labeling of graphs

open access: closed, 2009
Summary: Distance magic labeling of a graph of order \(n\) is a bijection \(f:V\to\{1,2,\dots,n\}\) with the property that there is a positive integer constant \(k\) such that for any vertex \(x\), \(\sum_{y\in N(x)}f(y)=k\), where \(N(x)\) is the set of vertices adjacent to \(x\).
Kiki Ariyanti Sugeng   +4 more
openalex   +2 more sources

Band-Selective Carbonyl to Aliphatic Side Chain 13C−13C Distance Measurements in U-13C,15N-Labeled Solid Peptides by Magic Angle Spinning NMR

open access: closedJournal of the American Chemical Society, 2004
We describe three-dimensional magic angle spinning NMR experiments that enable simultaneous band-selective measurement of the multiple distance constraints between carbonyl and side chain carbons in uniformly 13C,15N-labeled peptides. The approaches are designed to circumvent the dipolar truncation and to allow experimental separation of the multiple ...
Vladimir Ladizhansky, Robert G. Griffin
openalex   +3 more sources

CHAPTER 3. 13C–13C Distance Measurements by Polarization Transfer Matrix Analysis of 13C Spin Diffusion in a Uniformly 13C-Labeled Molecular Complex under Magic Angle Spinning

open access: closed, 2014
Spin diffusion of 13C polarization in NMR provides 13C−13C distances under magic angle spinning over a broad spectral width. However, there are difficulties in obtaining the distances accurately in uniformly 13C-labeled molecular complexes in solids. Effects of the weak long-range couplings are suppressed by strong short-range couplings.
Ayako Egawa   +2 more
openalex   +2 more sources

Home - About - Disclaimer - Privacy