Results 1 to 10 of about 23 (23)
List-antimagic labeling of vertex-weighted graphs [PDF]
A graph $G$ is $k$-$weighted-list-antimagic$ if for any vertex weighting $\omega\colon V(G)\to\mathbb{R}$ and any list assignment $L\colon E(G)\to2^{\mathbb{R}}$ with $|L(e)|\geq |E(G)|+k$ there exists an edge labeling $f$ such that $f(e)\in L(e)$ for ...
Zhanar Berikkyzy +4 more
doaj +1 more source
Orientable -distance magic regular graphs
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
Caterpillars Have Antimagic Orientations
An antimagic labeling of a directed graph D with m arcs is a bijection from the set of arcs of D to {1, …, m} such that all oriented vertex sums of vertices in D are pairwise distinct, where the oriented vertex sum of a vertex u is the sum of labels of ...
Lozano Antoni
doaj +1 more source
Some of the next articles are maybe not open access.
Antimagic orientation of graphs with minimum degree at least 33
Journal of Graph Theory, 2021Songling Shan
exaly
Antimagic orientation of subdivided caterpillars
Discrete Applied Mathematics, 2022Songling Shan
exaly
Antimagic orientations of graphs with given independence number
Discrete Applied Mathematics, 2021Zi-Xia Song, Donglei Yang
exaly
Antimagic orientations of graphs with large maximum degree
Discrete Mathematics, 2020Andrew Owens +2 more
exaly
Antimagic orientations of even regular graphs
Journal of Graph Theory, 2019Cun-Quan Zhang, Zi-Xia Song
exaly

