Results 1 to 10 of about 29,470 (238)
Orientable Z_n-distance magic labeling of the Cartesian product of many cycles [PDF]
Electronic Journal of Graph Theory and Applications, 2017 The following generalization of distance magic graphs was introduced in [2]. A directed Z_n-distance magic labeling of an oriented graph $\overrightarrow{G}=(V,A)$ of order n is a bijection $\overrightarrow{\ell}\colon V \rightarrow Z_n$ with the ...
Bryan Freyberg, Melissa Keranen
doaj +8 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
Orientable -distance magic regular graphs
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 +1 more source
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, T. Singh
doaj +2 more sources
Distance Magic Labeling and Two Products of Graphs [PDF]
Graphs and Combinatorics, 2014 Let $G=(V,E)$ be a graph of order $n$. A distance magic labeling of $G$ is a bijection $\ell \colon V\rightarrow {1,...,n}$ for which there exists a positive integer $k$ such that $\sum_{x\in N(v)}\ell (x)=k$ for all $v\in V $, where $N(v)$ is the neighborhood of $v$. We introduce a natural subclass of distance magic graphs. For this class we show that
Anholcer, Marcin +3 more
openaire +3 more sources
A note on incomplete regular tournaments with handicap two of order n≡8(mod 16) [PDF]
Opuscula Mathematica, 2017 A \(d\)-handicap distance antimagic labeling of a graph \(G=(V,E)\) with \(n\) vertices is a bijection \(f:V\to \{1,2,\ldots ,n\}\) with the property that \(f(x_i)=i\) and the sequence of weights \(w(x_1),w(x_2),\ldots,w(x_n)\) (where \(w(x_i)=\sum_{x_i
Dalibor Froncek
doaj +1 more source
D-magic strongly regular graphs
AKCE International Journal of Graphs and Combinatorics, 2020 For a set of distances D, a graph G on n vertices is said to be D-magic if there exists a bijection and a constant k such that for any vertex x, where is the D-neighbourhood set of x.
Rinovia Simanjuntak, Palton Anuwiksa
doaj +1 more source
Distance magic labelings of hypercubes
Electronic Notes in Discrete Mathematics, 2013 Abstract A distance magic labeling of a graph G is a bijective assignment of labels from {1, 2, …, |V (G)|} to the vertices of G such that the sum of labels on neighbors of u is the same for all vertices u. We show that the n-dimensional hypercube has a distance magic labeling for every n ≡ 2 ( mod 4 ) . It is known that this condition is
Petr Gregor, Petr Kovář
openaire +1 more source
A Heuristic for Distance Magic Labeling
Procedia Computer Science, 2015 AbstractA distance magic labeling of a graph G with magic constant k is a bijection λ from the V(G) into {1, 2,. . ., |V(G)|}, such that ∑u∈N(v) λ(u) = k for every vertex v. Here we present a heuristic algorithm for finding distance magic graphs and utilise it to find all distance magic graphs with at most 9 vertices.
Yasin, Fuad, Simanjuntak, Rinovia
openaire +1 more source
Distance Magic Labeling of Generalised Mycielskian Graphs
, 2023 In this paper, we have studied the distance magic labelling of Generalised Mycielskian of a few families of graphs.
Pawar, Ravindra, Singh, Tarkehswar
openaire +2 more sources