Results 131 to 140 of about 2,192 (158)

On Regular Distance Magic Graphs of Odd Order

Journal of Combinatorial Mathematics and Combinatorial Computing, 2023
Let G=(V,E) be a graph with n vertices. A bijection f:V→{1,2,…,n} is called a distance magic abeling f G if there exists an integer k such that ∑u∈N(v)f(u)=k for all v∈V, where N(v) is the set of all ertices adjacent to v. Any graph which admits a distance magic labeling is a distance magic graph.
Kovář, Petr, Silber, Adam, Kabelíková-Hrušková, Pavla, Kravčenko, Michal   +3 more
openaire   +2 more sources

On Nearly Distance Magic Graphs

2017
Let \(G=(V,E)\) be a graph on n vertices. A bijection \(f: V \rightarrow \{1,2,\ldots , n\}\) is called a nearly distance magic labeling of G if there exists a positive integer k such that \(\sum _{x \in N(v)} f(x)=k \ or \ k+1\) for every \(v \in V\). The constant k is called a magic constant of the graph and any graph which admits such a labeling is ...
Aloysius Godinho, T. Singh, S. Arumugam
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

Group distance magic set of group vertex magic graphs

Journal of Combinatorial Mathematics and Combinatorial Computing
<p>Let <span class="math inline">\(G\)</span> be a graph of order <span class="math inline">\(n\)</span> and let <span class="math inline">\(A\)</span> be an additive Abelian group with identity 0. A mapping <span class="math inline">\(l : V(G) \to A \setminus \{0\}\)</span> is said to be a <span
S.V. Bharanedhar, S. Balamoorthy, N. Kamatchi, S. Arumugam   +3 more
openaire   +1 more source

Matrices Associated with D-Distance Magic Graphs and Their Properties

Cybernetics and Systems Analysis, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Semeniuta, M., Shulhin, V.
openaire   +2 more sources

Distance magic labeling on shadow graphs

AIP Conference Proceedings, 2022
Chaithra Krishna, Shankaran Perikamana
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

Existence of Distance Magic Graph for Every Magic Constant

Dynamic Systems and Applications, 2021
K Sankar, V Sivakumaran
openaire   +1 more source

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, Jin Geng, Xiangneng Zeng
openaire   +1 more source

Tunable strongly coupled superconductivity in magic-angle twisted trilayer graphene

Nature, 2021
Jeong Min Park, Yuan Cao, Kenji Watanabe
exaly