Antimagicness of generalized corona and snowflake graphs

DOI10.1007/s11786-014-0213-xzbMath1308.05094OpenAlexW1994031309MaRDI QIDQ2018665

Costas S. Iliopoulos, Jacqueline W. Daykin, Mirka Miller, Oudone Phanalasy

Publication date: 25 March 2015

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-014-0213-x

zbMATH Keywords

antimagic labelinggeneralized snowflake graphsequential generalized corona graph

Mathematics Subject Classification ID

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

Related Items (4)

Formulas and algorithms of antimagic labelings of some helm related graphs ⋮ Finding Antimagic Labelings of Trees by Evolutionary Search ⋮ Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k\)] ⋮ Computing edge weights of magic labeling on rooted products of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel graph component labelling with GPUs and CUDA
• On anti-magic labeling for graph products
• The antimagicness of the Cartesian product of graphs
• Antimagic labeling of generalized pyramid graphs
• Sparse graphs with vertex antimagic edge labelings
• An Application of Completely Separating Systems to Graph Labeling
• Dense graphs are antimagic
• Numbered complete graphs, unusual rulers, and assorted applications
• Transitiv orientierbare Graphen

This page was built for publication: Antimagicness of generalized corona and snowflake graphs