Anti-magic labeling of trees
From MaRDI portal
Publication:397133
DOI10.1016/J.DISC.2014.04.021zbMATH Open1297.05205OpenAlexW2000746207MaRDI QIDQ397133FDOQ397133
Xuding Zhu, Yu-Chang Liang, Tsai-Lien Wong
Publication date: 8 August 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2014.04.021
Trees (05C05) Vertex degrees (05C07) Combinatorial aspects of partitions of integers (05A17) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
Cited In (40)
- Generation of anti-magic graphs from binary graph products
- Antimagic orientation of subdivided caterpillars
- Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k]\)
- Antimagic labeling for some snake graphs
- Every graph is homeomorphic to an antimagic bipartite graph
- Local antimagic orientations of \(d\)-degenerate graphs
- Caterpillars with maximum degree 3 are antimagic
- Antimagic labelings of caterpillars
- ON LOCAL ANTIMAGIC CHROMATIC NUMBER OF GRAPHS
- Product antimagic labeling of caterpillars
- Antimagic labeling of forests with sets of consecutive integers
- Antimagic orientation of lobsters
- Title not available (Why is that?)
- Antimagicness of lexicographic product graph \(G[P_n]\)
- Caterpillars are antimagic
- Edge-magic trees
- Antimagic orientation of Halin graphs
- On \(k\)-shifted antimagic spider forests
- Antimagic labeling of some biregular bipartite graphs
- Reverse super edge-magic strength of some special trees
- Trees whose even-degree vertices induce a path are antimagic
- Shifted-antimagic labelings for graphs
- Antimagic orientation of forests
- Antimagic labeling of cubic graphs
- Graphs admitting antimagic labeling for arbitrary sets of positive integers
- Antimagic Labeling of Regular Graphs
- Constructions of regular sparse anti-magic squares
- Local antimagic chromatic number for the corona product of wheel and null graphs
- Local vertex antimagic chromatic number of some wheel related graphs
- On the existence of regular sparse anti-magic squares of odd order
- Graphs admitting antimagic labeling for arbitrary sets of positive numbers
- Regular sparse anti-magic squares with small odd densities
- Antimagic labeling for subdivisions of graphs
- Labeling trees of small diameters with consecutive integers
- Graph antimagic labeling: a survey
- Antimagic labeling for unions of graphs with many three-paths
- The existence spectrum for regular sparse anti-magic squares
- Multi-bridge graphs are anti-magic
- Antimagic labeling of new classes of trees
- Lexicographic product graphs \(P_m[P_n]\) are antimagic
Recommendations
- Antimagic labeling of new classes of trees π π
- Title not available (Why is that?) π π
- On the antimagic labeling of star forests π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Vertex-magic labeling of trees and forests π π
- Edge-antimagic labelings of forests π π
- Sequential and magic labeling of a class of trees π π
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)