Antimagicness of generalized corona and snowflake graphs
From MaRDI portal
Publication:2018665
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
- scientific article; zbMATH DE number 47933 (Why is no real title available?)
- scientific article; zbMATH DE number 2215779 (Why is no real title available?)
- An application of completely separating systems to graph labeling
- Antimagic labeling of generalized pyramid graphs
- Dense graphs are antimagic
- Numbered complete graphs, unusual rulers, and assorted applications
- On anti-magic labeling for graph products
- Parallel graph component labelling with GPUs and CUDA
- Sparse graphs with vertex antimagic edge labelings
- The antimagicness of the Cartesian product of graphs
- Transitiv orientierbare Graphen
Cited in
(5)- Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k]\)
- Formulas and algorithms of antimagic labelings of some helm related graphs
- Finding Antimagic Labelings of Trees by Evolutionary Search
- Perfectly antimagic total labeling of star-like trees and the corona product of two graphs
- Computing edge weights of magic labeling on rooted products of graphs
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)
