Results 41 to 50 of about 909,592 (58)

A note on antimagic labelings of trees

, 2014
In 1990, Hartsfield and Ringel conjectured “Every tree except K2 is antimagic”, where antimagic means that there is a bijection from E(G) to {1, 2,…, |E(G)} such that at each vertex the weight (sum of the labels of incident edges) is different.
Miller, Mirka, Rylands, Leanne J. (R8511), Phanalasy, Oudone, Ryan, Joe   +3 more
core  

Sparse graphs with vertex antimagic edge labelings

, 2013
Hartsfeld and Ringel in 1990 introduced the concept of an antimagic labeling of a graph, that is, a vertex antimagic edge labeling and they also conjectured that every connected graph, except K2, is antimagic.
Miller, Mirka, Rylands, Leanne J. (R8511), Phanalasy, Oudone, Ryan, Joe   +3 more
core  

On Super Edge Local Antimagic Total Labeling by Using an Edge Antimagic Vertex Labeling Technique

, 2019
INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 8, ISSUE 07, JULY 2019In this paper, we consider that all graphs are finite, simple and connected. Let G(V,E) be a graph of vertex set V and edge set E.
Alfarisi, Ridho, Marsidi, Marsidi, Kurniawati, Elsa Yuli, Agustin, Ika Hesti, Dafik, Dafik   +4 more
core  

Antimagic labeling of graphs

The concept of labeling of graphs has attracted many researchers to this branch of research since the concept was introduced. It is becoming popular, partly because of mathematical challenges, and partly also because of the wide range of applications in ...
Oudone Phanalasy (21269891)
core  

Antimagic orientation of forests [PDF]

Discrete Mathematics, 2020
An antimagic labeling of a digraph $D$ with $n$ vertices and $m$ arcs is a bijection from the set of arcs of $D$ to $\{1,2,\cdots,m\}$ such that all $n$ oriented vertex-sums are pairwise distinct, where the oriented vertex-sum of a vertex is the sum of labels of all arcs entering that vertex minus the sum of labels of all arcs leaving it.
Songling Shan
exaly   +30 more sources

Antimagic Labeling of Regular Graphs

Journal of Graph Theory, 2016
A graph G = (V, E ) is antimagic if there is a one-to-one correspondence f : E → {1, 2,..., |E|} such that for any two vertices u, v, Σe∈ E(u) f(e)≠Σe∈E(v ) f(e).
Xuding Zhu, Yu-Chang Liang
exaly   +2 more sources

A note on antimagic orientations of even regular graphs [PDF]

Discrete Applied Mathematics, 2019
Motivated by the conjecture of Hartsfield and Ringel on antimagic labelings of undirected graphs, Hefetz, Mütze, and Schwartz initiated the study of antimagic labelings of digraphs in 2010. Very recently, it has been conjectured in [Antimagic orientation of even regular graphs, J.
Donglei Yang
exaly   +4 more sources

Antimagic orientation of Halin graphs

Discrete Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaowei Yu, Yulin Chang, Shan Zhou
exaly   +3 more sources

The Antimagic Orientations for Graphs Obtained by Some Graph Operations

Taiwanese Journal of Mathematics
The authors in this paper attempt to settle a conjecture, namely: Every connected graph admits an antimagic orientation. Although they don't fully settle the conjecture, they obtain some results that add strength to the conjecture in a positive sense. The proof techniques are quite interesting and deep.
Wei-Tian Li
exaly   +3 more sources

Antimagic orientations of graphs with a dominating clique

A graph G with m edges has an antimagic orientation if its edges can be oriented and bijectively labelled 1, ..., m so that the oriented vertex sums, the labels on in-arcs minus the labels on out-arcs, are pairwise distinct. Hefetz, Mütze and Schwartz conjectured that every connected graph admits an antimagic orientation.
openaire   +1 more source