Antimagic orientation of lobsters

DOI10.1016/J.DAM.2020.07.019MaRDI QIDQ2004070zbMATH OpenOpenAlexFDO

Authors Songling Shan, Yuping Gao

Publication date 14 October 2020

Published in Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

antimagic labelingantimagic orientationlobster

Mathematics Subject Classification ID

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

Abstract: Let $mge1$ be an integer and $G$ be a graph with $m$ edges. We say that $G$ has an antimagic orientation if $G$ has an orientation $D$ and a bijection $au:A(D)ightarrow1,2,cdots,m$ such that no two vertices in $D$ have the same vertex-sum under $au$, where the vertex-sum of a vertex $u$ in $D$ under $au$ is the sum of labels of all arcs entering $u$ minus the sum of labels of all arcs leaving $u$. Hefetz, M"{u}tze and Schwartz [J. Graph Theory, 64: 219-232, 2010] conjectured that every connected graph admits an antimagic orientation. The conjecture was confirmed for certain classes of graphs such as dense graphs, regular graphs, and trees including caterpillars and $k$-ary trees. In this note, we prove that every lobster admits an antimagic orientation.

Recommendations

• Antimagic orientation of subdivided caterpillars
• Caterpillars have antimagic orientations
• Antimagic orientations of graphs with large maximum degree
• Local antimagic orientation of graphs
• Antimagic orientations of graphs with given independence number

Cites work

• A dynamic survey of graph labeling
• A note on antimagic orientations of even regular graphs
• Anti-magic labeling of trees
• Antimagic labeling of cubic graphs
• Antimagic labeling of regular graphs
• Antimagic labelings of caterpillars
• Antimagic orientation of biregular bipartite graphs
• Antimagic orientation of Halin graphs
• Antimagic orientations for the complete \(k\)-ary trees
• Antimagic orientations of disconnected even regular graphs
• Antimagic orientations of even regular graphs
• Caterpillars have antimagic orientations
• scientific article; zbMATH DE number 728185 (Why is no real title available?)
• Local antimagic labeling of graphs
• On antimagic directed graphs
• On zero-sum partitions and anti-magic trees

Cited in

(10)

• Product antimagic labeling of caterpillars
• Antimagic labeling of biregular bipartite graphs
• LOBSTERS, CRABS, AND THE ABWEHR ENIGMA
• Caterpillars have antimagic orientations
• 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 orientation of lobsters

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