ON -ANTIMAGICNESS OF DISCONNECTED GRAPHS

DOI10.1017/S0004972716000204zbMath1361.05115OpenAlexW2964142277MaRDI QIDQ2986530

Mirka Miller, Andrea Semaničová-Feňovčíková, Martin Bača, Joseph F. Ryan

Publication date: 16 May 2017

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972716000204

zbMATH Keywords

\(H\)-coveringunion of graphssuper \((a,d)\)-\(H\)-antimagic labelling

Mathematics Subject Classification ID

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

Related Items (3)

Super \((a, d)\)-\(H\)-antimagic labeling of subdivided graphs ⋮ Ladders and fan graphs are cycle-antimagic ⋮ Unnamed Item

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
• Magic Graphs
• Magic Valuations of Finite Graphs

This page was built for publication: ON -ANTIMAGICNESS OF DISCONNECTED GRAPHS