Antimagicness of generalized corona and snowflake graphs
From MaRDI portal
Publication:2018665
DOI10.1007/S11786-014-0213-XzbMATH Open1308.05094OpenAlexW1994031309MaRDI QIDQ2018665FDOQ2018665
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
Recommendations
- Antimagicness for a family of generalized antiprism graphs
- Antimagicness of some families of generalized graphs
- On graceful antimagic graphs
- Edge-antimagic graphs
- Antimagic properties of graphs with large maximum degree
- A generalization of magic and antimagic labelings of graphs
- On antimagic directed graphs
- A class of totally antimagic total graphs
- Anti‐magic graphs via the Combinatorial NullStellenSatz
- Antimagic labeling of regular graphs
Cites Work
- Transitiv orientierbare Graphen
- Dense graphs are antimagic
- Title not available (Why is that?)
- On anti-magic labeling for graph products
- Numbered complete graphs, unusual rulers, and assorted applications
- Parallel graph component labelling with GPUs and CUDA
- 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
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: Antimagicness of generalized corona and snowflake graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018665)
