Results 1 to 10 of about 1,987 (90)
Orientable -distance magic regular graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2021 Hefetz, Mütze, and Schwartz conjectured that every connected undirected graph admits an antimagic orientation (Hefetz et al., 2010). In this paper we support the analogous question for distance magic labeling. Let be an Abelian group of order .
Paweł Dyrlaga, Karolina Szopa
doaj +2 more sources
Indonesian Journal of Combinatorics, 2016 Let ∆G be the maximum degree of a simple connected graph G(V,E). An injective mapping P : V → R∆G is said to be an orthogonal labeling of G if uv,uw ∈ E implying (P(v) − P(u)) · (P(w) − P(u)) = 0, where · is the usual dot product defined in Euclidean ...
Bernard Immanuel, Kiki A. Sugeng
doaj +3 more sources
A $$\varGamma $$-magic Rectangle Set and Group Distance Magic Labeling [PDF]
, 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
openaire +2 more sources
Some distance magic graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2018 A graph G = ( V , E ) , where | V | = n and | E | = m is said to be a distance magic graph if there exists a bijection from the vertex set V to the set { 1 , 2 , … , n } such that, ∑ v ∈ N ( u ) f ( v ) = k , for all u ∈ V , which is a constant and ...
Aloysius Godinho
exaly +2 more sources
Group Distance Magic Labeling of Cnr. [PDF]
, 2017 Aloysius Godinho, Tarkeshwar Singh
core +3 more sources
Orientable Group Distance Magic Labeling of Directed Graphs
Mathematical Problems in Engineering, 2022 A directed graph G is said to have the orientable group distance magic labeling if there exists an abelian group ℋ and one-one map ...
Wasim Ashraf +2 more
openaire +1 more source
Note on group distance magicness on product graphs [PDF]
, 2021 If $l$ is a bijection from the vertex set $V(G)$ of a graph $G$ to an additive abelian group $\Gamma$ of $|V(G)|$ elements such that for any vertex $u$ of $G$, the weight $\sum_{v\in N_{G}(u)}l(v)$ is $\mu$, where $\mu \in \Gamma$, then $l$ is a $\Gamma$-
Paramasivam, Krishnan +1 more
core +2 more sources
Amélioration de la DNP sélective (SelDNP) pour les applications biomoléculaires [PDF]
, 2023 Dynamic nuclear polarization (DNP) has emerged as a promising hyperpolarization technique to significantly enhance the sensitivity of solid-state nuclear magnetic resonance (NMR) experiments under magic angle spinning (MAS).
Dakhlaoui, Ons
core +4 more sources
Group distance magic labeling of direct product of graphs
Ars Mathematica Contemporanea, 2014 A distance magic labeling of a graph of order \(n\) is a bijection from the vertex set to \(\{0,1,\dots,n-1\}\) such that the sum of neighbors of any vertex is the same. Magic labellings of graphs have been studied as a generalization of magic squares. A central question has been to identify which graphs admit such labelings.
Marcin Anholcer +3 more
openaire +4 more sources
A SURVEY OF DISTANCE MAGIC GRAPHS [PDF]
, 2014 In this report, we survey results on distance magic graphs and some closely related graphs. A distance magic labeling of a graph G with magic constant k is a bijection l from the vertex set to {1, 2, . . .
Rupnow, Rachel
core +2 more sources