Bertrand's postulate, the prime number theorem and product anti-magic graphs

DOI10.1016/j.disc.2007.07.049zbMath1140.05050OpenAlexW2093893083MaRDI QIDQ2470444

Gil Kaplan, Yehuda Roditty, Arieh Lev

Publication date: 14 February 2008

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

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

zbMATH Keywords

labelingcomplete \(k\)-partite graphproduct anti-magic

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (4)

Product irregularity strength of graphs with small clique cover number ⋮ Characterization of product anti-magic graphs of large order ⋮ Product antimagic labeling of caterpillars ⋮ On zero-sum partitions and anti-magic trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dense graphs are antimagic
• The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2

This page was built for publication: Bertrand's postulate, the prime number theorem and product anti-magic graphs