Antimagic orientations of disconnected even regular graphs

DOI10.1016/J.DISC.2019.05.012MaRDI QIDQ2319719zbMATH OpenOpenAlexWikidataFDO

Authors Chen Song, Rong-Xia Hao

Publication date 20 August 2019

Published in Discrete Mathematics (Search for Journal in Brave)

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

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,2,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$. An antimagic orientation $D$ of a graph $G$ is $antimagic$ if $D$ has an antimagic labeling. Hefetz, M$ddotu$tze and Schwartz in [J. Graph Theory 64(2010)219-232] raised the question: Does every graph admits an antimagic orientation? It had been proved that for any integer $d$, every 2$d$-regular graph with at most two odd components has an antimagic orientation. In this paper, we consider the 2$d$-regular graph with many odd components. We show that every 2$d$-regular graph with any odd components has an antimagic orientation provide each odd component with enough order.

Recommendations

• Antimagic orientations of even regular graphs
• A note on antimagic orientations of even regular graphs
• Antimagic orientations of graphs with large maximum degree
• Antimagic orientation of biregular bipartite graphs
• Antimagic orientations of graphs with given independence number

Cites work

• Antimagic labeling of regular graphs
• Antimagic orientation of biregular bipartite graphs
• Antimagic orientations of even regular graphs
• Caterpillars have antimagic orientations
• Dense graphs are antimagic
• On antimagic directed graphs
• Regular bipartite graphs are antimagic
• Regular graphs of odd degree are antimagic

Cited in

(12)

• Tree-antimagicness of disconnected graphs
• Local antimagic orientations of \(d\)-degenerate graphs
• Antimagic orientation of lobsters
• Product antimagic labeling of caterpillars
• A note on antimagic orientations of even regular graphs
• List-antimagic labeling of vertex-weighted graphs
• Antimagic orientations of even regular graphs
• Antimagic orientation of graphs with minimum degree at least 33
• 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 disconnected even regular graphs

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