✦ LIBER ✦

On antimagic directed graphs

✍ Scribed by Dan Hefetz; Torsten Mütze; Justus Schwartz

Publisher: John Wiley and Sons
Year: 2009
Tongue: English
Weight: 139 KB
Volume: 64
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.20451

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

An antimagic labeling of an undirected graph G with n vertices and m edges is a bijection from the set of edges of G to the integers {1, …, m} such that all n vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with that vertex. A graph is called antimagic if it admits an antimagic labeling. In (N. Hartsfield and G. Ringel, Pearls in Graph Theory, Academic Press, Boston, 1990, pp. 108–109), Hartsfield and Ringel conjectured that every simple connected graph, other than K~2~, is antimagic. Despite considerable effort in recent years, this conjecture is still open. In this article we study a natural variation; namely, we consider antimagic labelings of directed graphs. In particular, we prove that every directed graph whose underlying undirected graph is “dense” is antimagic, and that almost every undirected d‐regular graph admits an orientation which is antimagic. © 2009 Wiley Periodicals, Inc. J Graph Theory 64: 219–232, 2010

📜 SIMILAR VOLUMES

Dense graphs are antimagic

✍ N. Alon; G. Kaplan; A. Lev; Y. Roditty; R. Yuster 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB

## Abstract An __antimagic labeling__ of graph a with __m__ edges and __n__ vertices is a bijection from the set of edges to the integers 1,…,__m__ such that all __n__ vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with the same vertex. A graph is c

Regular bipartite graphs are antimagic

✍ Daniel W. Cranston 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB

## Abstract A labeling of a graph __G__ is a bijection from __E__(__G__) to the set {1, 2,… |__E__(__G__)|}. A labeling is __antimagic__ if for any distinct vertices __u__ and __v__, the sum of the labels on edges incident to __u__ is different from the sum of the labels on edges incident to __v__.

Antimagic labelling of vertex weighted g

Antimagic labelling of vertex weighted graphs

✍ Tsai-Lien Wong; Xuding Zhu 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB

## Abstract Suppose __G__ is a graph, __k__ is a non‐negative integer. We say __G__ is __k__‐antimagic if there is an injection __f__: __E__→{1, 2, …, |__E__| + __k__} such that for any two distinct vertices __u__ and __v__, . We say __G__ is weighted‐__k__‐antimagic if for any vertex weight functi

On persistent directed graphs

✍ Jorgen Bang-Jensen; Tibor Jordán 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 209 KB

Directed hamiltonian graphs

✍ Yannis Manoussakis 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 386 KB

## Abstract We give a new condition involving degrees sufficient for a digraph to be hamiltonian.

Theorem on directed graphs, applicable t

Theorem on directed graphs, applicable to logic

✍ D. J. Shoesmith; T. J. Smiley 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB

## Abstract A semicycle is said to turn at a point __a__ if the arcs incident to __a__ are both to it or both from it. We prove that if a nonempty set of points of a finite directed graph contains a turning point of each semicycle, then one of its members is a turning point of every semicycle to wh