Recommendations
- Antimagic labeling of new classes of trees
- Antimagic labeling of linear forests
- On the antimagic labeling of star forests
- A note on antimagic labelings of trees
- Magic properties of special class of trees
- scientific article; zbMATH DE number 1944626
- Antimagicness of star forests
- Vertex-magic labeling of trees and forests
- Edge-antimagic labelings of forests
- Sequential and magic labeling of a class of trees
Cites work
Cited in
(42)- Antimagic labeling for subdivisions of graphs
- Antimagic labeling of new classes of trees
- Antimagic labeling of regular graphs
- Local antimagic orientations of \(d\)-degenerate graphs
- Antimagic labelings of caterpillars
- Shifted-antimagic labelings for graphs
- Constructions of regular sparse anti-magic squares
- On \(k\)-shifted antimagic spider forests
- Local antimagic chromatic number for the corona product of wheel and null graphs
- Antimagic orientation of subdivided caterpillars
- Antimagic labeling of forests
- Product antimagic labeling of caterpillars
- Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k]\)
- Local vertex antimagic chromatic number of some wheel related graphs
- Antimagic labeling of forests with sets of consecutive integers
- The existence spectrum for regular sparse anti-magic squares
- Disproofs of two conjectures on no hole anti-\(n\)-labeling of graphs
- Labeling trees of small diameters with consecutive integers
- Graphs admitting antimagic labeling for arbitrary sets of positive integers
- Trees whose even-degree vertices induce a path are antimagic
- Edge-magic trees
- Antimagic labeling of some biregular bipartite graphs
- Antimagicness of lexicographic product graph \(G[P_n]\)
- Multi-bridge graphs are anti-magic
- Reverse super edge-magic strength of some special trees
- Lexicographic product graphs \(P_m[P_n]\) are antimagic
- Antimagic labeling for some snake graphs
- Graph antimagic labeling: a survey
- Antimagic labeling for unions of graphs with many three-paths
- Antimagic labeling of cubic graphs
- Generation of anti-magic graphs from binary graph products
- Antimagic orientation of Halin graphs
- Antimagic orientation of forests
- Every graph is homeomorphic to an antimagic bipartite graph
- Regular sparse anti-magic squares with small odd densities
- Graphs admitting antimagic labeling for arbitrary sets of positive numbers
- Caterpillars are antimagic
- On the existence of regular sparse anti-magic squares of odd order
- Antimagic orientation of lobsters
- A note on antimagic labelings of trees
- On local antimagic chromatic number of graphs
- Caterpillars with maximum degree 3 are antimagic
This page was built for publication: Anti-magic labeling of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q397133)