Antimagic orientation of Halin graphs

DOI10.1016/J.DISC.2019.06.024MaRDI QIDQ2324503zbMATH OpenOpenAlexWikidataFDO

Authors Xiaowei Yu, Yu-Lin Chang, Shan Zhou

Publication date 11 September 2019

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2019.06.024

zbMATH Keywords

antimagic labelingantimagic orientationHalin graphlabeling

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Antimagic orientations of graphs with large maximum degree
• On antimagic directed graphs
• Antimagic orientations of even regular graphs
• Antimagic orientations of graphs with given independence number
• Antimagic orientation of graphs with minimum degree at least 33

Cites work

• An application of the combinatorial nullstellensatz to a graph labelling problem
• Anti-magic labeling of trees
• Antimagic labeling of regular graphs
• Antimagic orientation of biregular bipartite graphs
• Antimagic orientations of even regular graphs
• Antimagic properties of graphs with large maximum degree
• Anti‐magic graphs via the Combinatorial NullStellenSatz
• Caterpillars have antimagic orientations
• Dense graphs are antimagic
• Graphs of large linear size are antimagic
• scientific article; zbMATH DE number 47933 (Why is no real title available?)
• Local antimagic orientations of \(d\)-degenerate graphs
• On antimagic directed graphs
• On zero-sum partitions and anti-magic trees
• Regular bipartite graphs are antimagic
• Regular graphs of odd degree are antimagic

Cited in

(14)

• Antimagic orientation of lobsters
• Antimagic orientations of graphs with large maximum degree
• Antimagic labeling of biregular bipartite graphs
• Antimagic orientations for the complete \(k\)-ary trees
• Antimagic labeling of digraphs
• Antimagic orientations of even regular graphs
• Antimagic orientation of graphs with minimum degree at least 33
• Antimagic orientation of forests
• Approaches that output infinitely many graphs with small local antimagic chromatic number
• 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 Halin graphs

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