Antimagic orientations of even regular graphs

DOI10.1002/JGT.22366MaRDI QIDQ5379814zbMATH OpenOpenAlexFDO

Authors Tong Li, Z. X. Song, Guanghui Wang, Donglei Yang, Cun-Quan Zhang

Publication date 14 June 2019

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1707.03507

zbMATH Keywords

antimagic labelingantimagic orientationregular graph

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Abstract: A labeling of a digraph $D$ with $m$ arcs is a bijection from the set of arcs of $D$ to $1,ldots,m$. A labeling of $D$ is antimagic if no two vertices in $D$ have the same vertex-sum, where the vertex-sum of a vertex $uinV(D)$ for a labeling is the sum of labels of all arcs entering $u$ minus the sum of labels of all arcs leaving $u$. Motivated by the conjecture of Hartsfield and Ringel from 1990 on antimagic labelings of graphs, Hefetz, M"utze, and Schwartz [On antimagic directed graphs, J Graph Theory 64 (2010) 219--232] initiated the study of antimagic labelings of digraphs, and conjectured that every connected graph admits an antimagic orientation, where an orientation $D$ of a graph $G$ is antimagic if $D$ has an antimagic labeling. It remained unknown whether every disjoint union of cycles admits an antimagic orientation. In this paper, we first answer this question in the positive by proving that every $2$-regular graph has an antimagic orientation. We then show that for any integer $dge2$, every connected, $2d$-regular graph has an antimagic orientation. Our technique is new.

Recommendations

• A note on antimagic orientations of even regular graphs
• Antimagic orientations of disconnected even regular graphs
• Antimagic orientation of biregular bipartite graphs
• Antimagic orientation of Halin graphs
• Antimagic orientations of graphs with large maximum degree
• Antimagic orientations of graphs with given independence number
• Local antimagic orientation of graphs
• On antimagic labeling of odd regular graphs
• Antimagic labeling of regular graphs
• Regular graphs of odd degree are antimagic

Cited in

(20)

• Antimagic orientation of biregular bipartite graphs
• Antimagic orientation of lobsters
• Antimagic orientations of graphs with large maximum degree
• Antimagic labeling of biregular bipartite graphs
• Local antimagic orientation of graphs
• Antimagic orientations for the complete \(k\)-ary trees
• Antimagic orientations of disconnected even regular graphs
• A note on antimagic orientations of even regular graphs
• Antimagic orientation of Halin graphs
• Antimagic orientations of graphs with given independence number
• scientific article; zbMATH DE number 6374002 (Why is no real title available?)
• On antimagic directed graphs
• Antimagic labeling of digraphs
• Antimagic orientation of graphs with minimum degree at least 33
• Antimagic orientation of forests
• Graph antimagic labeling: a survey
• Antimagic labeling for subdivisions of graphs
• The antimagic orientations for graphs obtained by some graph operations
• Antimagic labeling of subdivided caterpillars
• Antimagic orientation of subdivided caterpillars

This page was built for publication: Antimagic orientations of even regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5379814)