Results 191 to 200 of about 2,737 (220)

Distance Magic Labeling of the Halved Folded n-Cube

Lecture Notes in Computer Science, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Na Kang, Ding-Zhu Du, Suogang Gao
exaly   +2 more sources

Characterize group distance magic labeling of Cartesian product of two cycles

Discrete Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiangneng Zeng, Guixin Deng, Caimei Luo
exaly   +3 more sources

Group distance magic labeling of tetravalent circulant graphs

Discrete Applied Mathematics
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
exaly   +2 more sources

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

Bulletin of the Iranian Mathematical Society
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guixin Deng
exaly   +3 more sources

Distance magic labelings of graphs [PDF]

Australas. J Comb., 2003
Authors define 1-vertex-magic labelling of a graph \(G=(V,E)\) as a bijection \(f\colon \{1,2,\dots, |V|\} \to V\) such that for any two vertices \(u,v \in V\), \(\sum_{x\in N(u)}f(x)=\sum_{y\in N(v)}f(y)\). The authors solve the existence problem of 1-vertex-magic labellings on complete bipartite, tripartite and regular multipartite graphs.
Mirka Miller, Chris Rodger, Rinovia Simanjuntak   +2 more
openaire   +1 more source

Distance Magic and Distance Antimagic Labeling of Some Product Graphs

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
openaire   +1 more source

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

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.
openaire   +1 more source

On distance magic labeling of graphs

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\).
Sugeng, K. A., Fronček, D., Miller, M., Ryan, J., Walker, J.   +4 more
openaire   +1 more source

A magic-angle-spinning NMR method for H1–H1 distance measurement using coherent polarization transfer in C13-labeled organic solids

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, Hideo, Akutsu, Toshimichi, Fujiwara   +2 more
openaire   +2 more sources