Aug 16, 2019 · We say (D, \tau) is an antimagic orientation of a graph G if D is an orientation of G and \tau is an antimagic labeling of D.

In this paper, we prove that every connected graph on vertices with maximum degree at least admits an antimagic orientation.

Aug 16, 2019 · Abstract. Given a digraph D with m arcs, a bijection τ : A(D) → {1, 2,...,m} is an antimagic labeling of D if no two vertices in D have the ...

An antimagic labeling of a connected graph with ℓ edges is an injective assignment of labels from {1,…,ℓ}{1,…,ℓ} to the edges such that the sums of incident ...

Semantic Scholar extracted view of "Antimagic orientations of graphs with large maximum degree" by Donglei Yang et al.

Aug 31, 2019 · An antimagic labeling of a connected graph with ℓ edges is an injective assignment of labels from {1,…,ℓ}{1,…,ℓ} to the edges such that the sums ...

No information is available for this page. · Learn why

Motivated by the conjecture of Hartsfield and Ringel (1990) on antimagic labelings of graphs, Hefetz et al. (2010) initiated the study of antimagic orientations ...

Jul 26, 2011 · Abstract. An antimagic labeling of a graph with m edges and n vertices is a bijection from the set of edges to the integers 1,...,m such ...

Jul 26, 2021 · In this paper, we show that every bipartite graph with no vertex of degree 0 or 2 admits an antimagic orientation and every graph with minimum degree at least ...