Antimagic orientations for the complete k-ary trees

DOI10.1007/S10878-019-00437-7zbMATH Open1431.05135OpenAlexW2960834185MaRDI QIDQ2279747FDOQ2279747

Authors: Chen Song, Rong-Xia Hao 

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

Recommendations

• Antimagic orientations of graphs with large maximum degree
• Antimagic orientation of Halin graphs
• Antimagic orientations of graphs with given independence number
• Antimagic orientations of even regular graphs
• Local antimagic orientation of graphs

zbMATH Keywords

antimagic labelingantimagic orientationcomplete \(k\)-ary tree

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Antimagic orientation of subdivided caterpillars
• Product antimagic labeling of caterpillars
• Antimagic orientation of lobsters
• Graph antimagic labeling: a survey
• Title not available (Why is that?)

This page was built for publication: Antimagic orientations for the complete \(k\)-ary trees

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