Results 21 to 30 of about 2,348 (174)
On distance magic labelings of Hamming graphs and folded hypercubes [PDF]
Discussiones Mathematicae Graph TheorySummary: Let \(\Gamma =(V,E)\) be a graph of order \(n\). A distance magic labeling of \(\Gamma\) is a bijection \(\ell \colon V \to \{1,2, \ldots, n\}\) for which there exists a positive integer \(k\) such that \(\sum_{x \in N(u)} \ell(x) = k\) for all vertices \(u \in V\), where \(N(u)\) is the neighborhood of \(u\).
Miklavič, Štefko, Šparl, Primož
openaire +5 more sources
Handicap Labelings of 4-Regular Graphs [PDF]
Advances in Electrical and Electronic Engineering, 2017 Let G be a simple graph, let f : V(G)→{1,2,...,|V(G)|} be a bijective mapping. The weight of v ∈ V(G) is the sum of labels of all vertices adjacent to v. We say that f is a distance magic labeling of G if the weight of every vertex is the same
Petr Kovar +3 more
doaj +3 more sources
On Structural and Spectral Properties of Distance Magic Graphs [PDF]
, 2023 A graph $G=(V,E)$ is said to be distance magic if there is a bijection $f$ from a vertex set of $G$ to the first $|V(G)|$ natural numbers such that for each vertex $v$, its weight given by $\sum_{u \in N(v)}f(u)$ is constant, where $N(v)$ is an open neighborhood of a vertex $v$. In this paper, we introduce the concept of $p$-distance magic labeling and
Mukherjee, Himadri +2 more
openaire +3 more sources
Distance Magic Labeling of Corona Product of Graphs
InPrimeLet G = (V, E) is a graph with order n, and f: V(G) → {1,2,...,n} is a bijection. For any vertex v ϵ V, the sum of f(u) is called the weight of vertex v, denoted by w(v), where N(v) is the set of neighbors of vertex v.
Christyan Tamaro Nadeak
doaj +2 more sources
On D-distance (anti)magic labelings of shadow graph of some graphs
Electronic Journal of Graph Theory and ApplicationsLet G be a graph with vertex set V(G) and diameter diam(G). Let D ⊆ {0, 1, 2, 3, …, diam(G)} and φ : V(G)→{1, 2, 3, …, |V(G)|} be a bijection. The graph G is called D-distance magic, if s ∈ ND(t)φ(s) is a constant for any vertex t ∈ V(G). The graph G is
Anak Agung Gede Ngurah +2 more
doaj +3 more sources
A Complete Characterization of Magic Constants Arising from Distance Magic Graphs [PDF]
Journal of Combinatorial Mathematics and Combinatorial Computing, 2023 A positive integer \(k\) is called a magic constant if there is a graph \(G\) along with a bijective function \(f\) from \(V(G)\) to the first \(|V(G)|\) natural numbers such that the weight of the vertex \(w(v) = \sum_{uv \in E} f(u) = k\) for all \(v \in V\).
Pawar, Ravindra +3 more
openaire +4 more sources
A SURVEY OF DISTANCE MAGIC GRAPHS [PDF]
, 2020 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
openaire +4 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
On distance magic circulants of valency 6 [PDF]
, 2022 A graph $Γ= (V,E)$ of order $n$ is {\em distance magic} if it admits a bijective labeling $\ell \colon V \to \{1,2, \ldots, n\}$ of its vertices for which there exists a positive integer $κ$ such that $\sum_{u \in N(v)} \ell(u) = κ$ for all vertices $v ...
Miklavič, Štefko, Šparl, Primož
core +2 more sources
On distance labelings of 2-regular graphs
Electronic Journal of Graph Theory and Applications, 2021 Let G be a graph with |V(G)| vertices and ψ : V(G) → {1, 2, 3, ... , |V(G)|} be a bijective function. The weight of a vertex v ∈ V(G) under ψ is wψ(v) = ∑u ∈ N(v)ψ(u). The function ψ is called a distance magic labeling of G, if wψ(v) is a constant for
Anak Agung Gede Ngurah +1 more
doaj +1 more source