On zero-sum partitions and anti-magic trees

DOI10.1016/j.disc.2008.04.012zbMath1229.05031OpenAlexW2083043838MaRDI QIDQ1025454

Gil Kaplan, Yehuda Roditty, Arieh Lev

Publication date: 19 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.04.012

zbMATH Keywords

anti-magic graphszero-sum partitions

Mathematics Subject Classification ID

Trees (05C05) Combinatorial aspects of partitions of integers (05A17)

Related Items (44)

Group sum chromatic number of graphs ⋮ Antimagic orientation of subdivided caterpillars ⋮ Antimagic labelling of vertex weighted graphs ⋮ Note on group irregularity strength of disconnected graphs ⋮ Weighted antimagic labeling: an algorithmic approach ⋮ Trees whose even-degree vertices induce a path are antimagic ⋮ Antimagic Labeling of Regular Graphs ⋮ Antimagic labeling of some biregular bipartite graphs ⋮ Multi-bridge graphs are anti-magic ⋮ Antimagic orientations of graphs with given independence number ⋮ Antimagic orientation of biregular bipartite graphs ⋮ Anti-magic labeling of trees ⋮ Antimagic orientation of graphs with minimum degree at least 33 ⋮ Antimagic orientation of forests ⋮ Realization of digraphs in Abelian groups and its consequences ⋮ Labeling trees of small diameters with consecutive integers ⋮ Generation of anti-magic graphs from binary graph products ⋮ Zero sum partition of abelian groups into sets of the same order and its applications ⋮ On zero sum-partition of Abelian groups into three sets and group distance magic labeling ⋮ Weighted-1-antimagic graphs of prime power order ⋮ Antimagic labeling for unions of graphs with many three-paths ⋮ Note on group distance magic complete bipartite graphs ⋮ Lexicographic product graphs \(P_m[P_n\) are antimagic] ⋮ Orientable \(\mathbb{Z}_N\)-distance magic graphs ⋮ Unnamed Item ⋮ Caterpillars are antimagic ⋮ On constant sum partitions and applications to distance magic-type graphs ⋮ Partially magic labelings and the antimagic graph conjecture ⋮ Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k\)] ⋮ Weighted antimagic labeling ⋮ Approximate results for rainbow labelings ⋮ Caterpillars with maximum degree 3 are antimagic ⋮ Antimagic orientation of lobsters ⋮ Antimagic labelings of caterpillars ⋮ Antimagicness of lexicographic product graph \(G[P_n\)] ⋮ On antimagic directed graphs ⋮ An Application of the combinatorial Nullstellensatz to a graph labelling problem ⋮ Shifted-antimagic labelings for graphs ⋮ Product antimagic labeling of caterpillars ⋮ Antimagic labeling of forests with sets of consecutive integers ⋮ Antimagic orientation of Halin graphs ⋮ Antimagic labeling of new classes of trees ⋮ Antimagic Labeling of Cubic Graphs ⋮ Group irregularity strength of connected graphs

Cites Work

• Covering the alternating groups by products of cycle classes.
• Bertrand's postulate, the prime number theorem and product anti-magic graphs
• Dense graphs are antimagic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On zero-sum partitions and anti-magic trees