Caterpillars Have Antimagic Orientations

An of a directed graph with arcs is a bijection from the set of arcs of to {1, …, } such that all oriented vertex sums of vertices in are pairwise distinct, where the of a vertex is the sum of labels of all arcs entering minus the sum of labels of all arcs leaving . conjectured that every connected...

Full description

Saved in:
Bibliographic Details
Published in:Analele ştiinţifice ale Universităţii "Ovidius" Constanţa. Seria Matematică Vol. 26; no. 3; pp. 171 - 180
Main Author: Lozano, Antoni
Format: Journal Article Publication
Language:English
Published: Constanta Sciendo 01.01.2018
De Gruyter Brill Sp. z o.o., Paradigm Publishing Services
Subjects:
68 Computer science
68R Discrete mathematics in relation to computer science
Antimagic labeling
Antimagic orientation
Caterpillar
Classificació AMS
Grafs, Teoria de
Graph theory
Matemàtica discreta
Matemàtiques i estadística
Primary 68R10
Secondary 05C78, 05C05, 05C20
Teoria de grafs
Àrees temàtiques de la UPC
ISSN:1844-0835, 1224-1784, 1844-0835
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An of a directed graph with arcs is a bijection from the set of arcs of to {1, …, } such that all oriented vertex sums of vertices in are pairwise distinct, where the of a vertex is the sum of labels of all arcs entering minus the sum of labels of all arcs leaving . conjectured that every connected graph admits an antimagic orientation, where an of a graph is an orientation of which has an antimagic labeling. We use a constructive technique to prove that caterpillars, a well-known subclass of trees, have antimagic orientations.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1844-0835
1224-1784
1844-0835
DOI:10.2478/auom-2018-0039