On k-shifted antimagic spider forests
From MaRDI portal
Recommendations
Cites work
- A dynamic survey of graph labeling
- Anti-magic labeling of trees
- Antimagic labeling for unions of graphs with many three-paths
- Antimagic labeling of forests with sets of consecutive integers
- Antimagic labeling of linear forests
- Antimagic labeling of regular graphs
- Antimagic labelings of caterpillars
- Antimagic labelling of vertex weighted graphs
- Antimagicness of star forests
- Caterpillars are antimagic
- Caterpillars with maximum degree 3 are antimagic
- Dense graphs are antimagic
- scientific article; zbMATH DE number 6712556 (Why is no real title available?)
- scientific article; zbMATH DE number 6537750 (Why is no real title available?)
- scientific article; zbMATH DE number 47933 (Why is no real title available?)
- scientific article; zbMATH DE number 7714106 (Why is no real title available?)
- On zero-sum partitions and anti-magic trees
- Regular bipartite graphs are antimagic
- Shifted-antimagic labelings for graphs
- The strongly antimagic labelings of double spiders
- Trees whose even-degree vertices induce a path are antimagic
This page was built for publication: On \(k\)-shifted antimagic spider forests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6611091)