Ladders and fan graphs are cycle-antimagic

DOI10.15672/hujms.647228zbMath1488.05437OpenAlexW2983542520MaRDI QIDQ5163256

Martin Bača, Narayanaperumal Thillaiammal Muthuraja, P. Selvagopal, Andrea Semaničová-Feňovčíková, P. Jeyanthi

Publication date: 3 November 2021

Published in: Hacettepe Journal of Mathematics and Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15672/hujms.647228

zbMATH Keywords

ladder\(H\)-coveringsuper \((a,d)\)-\(H\)-antimagic total labelingfan graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Wheels are cycle-antimagic
• Labelings of plane graphs containing Hamilton path
• Super \(d\)-antimagic labelings of disconnected plane graphs
• \(H\)-supermagic labelings of graphs
• Tree-antimagicness of disconnected graphs
• Supermagic coverings of the disjoint union of graphs and amalgamations
• Antimagic labeling of generalized pyramid graphs
• Cycle-magic graphs
• ON -ANTIMAGICNESS OF DISCONNECTED GRAPHS
• Magic Graphs
• Magic Valuations of Finite Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Ladders and fan graphs are cycle-antimagic