Tree-antimagicness of disconnected graphs

DOI10.1155/2015/504251zbMath1393.05226OpenAlexW1972324297WikidataQ59118783 ScholiaQ59118783MaRDI QIDQ1665840

Martin Bača, Andrea Semaničová-Feňovčíková, Muhammad Awais Umar, Zuzana Kimáková

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/504251

Mathematics Subject Classification ID

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

Related Items (5)

\(H\)-coverings of path-amalgamated ladders and fans ⋮ ON -ANTIMAGICNESS OF DISCONNECTED GRAPHS ⋮ On $H$-antimagicness of Cartesian product of graphs ⋮ Ladders and fan graphs are cycle-antimagic ⋮ Unnamed Item

Cites Work

• Wheels are cycle-antimagic
• \(H\)-supermagic labelings of graphs
• Cycle-magic graphs
• Magic Graphs
• Magic Valuations of Finite Graphs
• The place of super edge-magic labelings among other classes of labelings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Tree-antimagicness of disconnected graphs