Results 171 to 180 of about 37,872 (210)

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, Zhijuan Wang, Zhipeng Xie, Zeng Xiang-neng   +3 more
semanticscholar   +4 more sources

RETRACTED: Distance magic labeling of join of graphs and big data analysis

Journal of Intelligent & Fuzzy Systems
This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.
V. Sivakumaran, K. Siva Sankar
semanticscholar   +3 more sources

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
semanticscholar   +3 more sources

Group Distance Magic Labeling of $$C_n^r$$ C n r

International Conference on Algorithms and Discrete Applied Mathematics, 2017
Aloysius Godinho, T. Singh
semanticscholar   +3 more sources

Distance Magic Labeling of the Halved Folded n-Cube

Journal of Combinatorial Optimization, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yi Tian, Na Kang, Weili Wu, Ding‐Zhu Du, Suogang Gao   +4 more
openalex   +2 more sources

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

Journal 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

On (a, d )-Distance Anti-Magic and 1-Vertex Bimagic Vertex Labelings of Certain Types of Graphs

Cybernetics and Systems Analysis, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. F. Semeniuta
openalex   +2 more sources

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\).
Kiki Ariyanti Sugeng, Dalibor Fronček, Mirka Miller, Joe Ryan, James Q. Walker   +4 more
openalex   +2 more sources

Distance magic labeling of the halved folded n-cube

Journal of combinatorial optimization, 2023
Yi Tian, Na Kang, Weili Wu, Ding‐Zhu Du, Suogang Gao   +4 more
openalex   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Tetravalent distance magic graphs of small order and an infinite family of examples

Ars Math. Contemp., 2023
A graph of order $n$ is distance magic if it admits a bijective labeling of its vertices with integers from $1$ to $n$ such that each vertex has the same sum of the labels of its neighbors.
Ksenija Rozman, P. Šparl
semanticscholar   +1 more source