Stacked book graphs are cycle-antimagic

DOI10.3934/math.2020387zbMath1484.05182OpenAlexW3045016360MaRDI QIDQ2132164

Saima Nazeer, Youyuan Liu, Yu-Ming Chu, Xinqiang Ma, Muhammad Awais Umar

Publication date: 27 April 2022

Published in: AIMS Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/math.2020387

zbMATH Keywords

book graph\(r\) subdivided stacked book graph \(SB_{(p, q)}(r)\)stacked book graph \(SB_{(p, q)}\)super \((\alpha, d)\)-\(C_{4(r+1)}\)-antimagic labelingsuper \((\alpha, d)\)-\(C_4\)-antimagic labeling

Mathematics Subject Classification ID

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

Related Items (2)

On the 2-metric resolvability of graphs ⋮ On post quantum integral inequalities

Cites Work

• Magic and antimagic \(H\)-decompositions
• \(H\)-supermagic labelings of graphs
• Supermagic coverings of the disjoint union of graphs and amalgamations
• Cycle-magic graphs
• Magic Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Stacked book graphs are cycle-antimagic