Antimagic orientations for the complete \(k\)-ary trees
From MaRDI portal
Publication:2279747
DOI10.1007/s10878-019-00437-7zbMath1431.05135OpenAlexW2960834185MaRDI QIDQ2279747
Publication date: 13 December 2019
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-019-00437-7
Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Directed graphs (digraphs), tournaments (05C20)
Related Items (3)
Antimagic orientation of subdivided caterpillars ⋮ Antimagic orientation of lobsters ⋮ Product antimagic labeling of caterpillars
Cites Work
- Antimagic orientation of biregular bipartite graphs
- Antimagic labelings of caterpillars
- Regular Graphs of Odd Degree Are Antimagic
- On antimagic directed graphs
- Dense graphs are antimagic
- Antimagic Labeling of Regular Graphs
- Regular bipartite graphs are antimagic
- Antimagic orientations of even regular graphs
This page was built for publication: Antimagic orientations for the complete \(k\)-ary trees