On Antimagic Labeling for Generalized Web and Flower Graphs

DOI10.1007/978-3-642-19222-7_31zbMath1326.05139OpenAlexW1637861581MaRDI QIDQ3000518

Mirka Miller, Oudone Phanalasy, Leanne J. Rylands, Joseph F. Ryan

Publication date: 19 May 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19222-7_31

zbMATH Keywords

\(m\)-level generalized flower graph\(m\)-level generalized web graph

Mathematics Subject Classification ID

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

Related Items (4)

Super edge trimagic total labeling of generalized prism and web graphs ⋮ Antimagic labeling of generalized pyramid graphs ⋮ Approximate results for rainbow labelings ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• A new class of antimagic Cartesian product graphs
• A dynamic survey of graph labeling
• On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs
• Regular bipartite graphs are antimagic
• On a problem concerning separating systems of a finite set

This page was built for publication: On Antimagic Labeling for Generalized Web and Flower Graphs