A new class of antimagic Cartesian product graphs

DOI10.1016/j.disc.2007.12.032zbMath1211.05140OpenAlexW2063805666MaRDI QIDQ998385

Yongxi Cheng

Publication date: 28 January 2009

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

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

zbMATH Keywords

magiclabelingregular graphCartesian productantimagic

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)

Related Items (19)

On local edge antimagic chromatic number of graphs ⋮ On edge-graceful labeling and deficiency for regular graphs ⋮ A new class of antimagic join graphs ⋮ On antimagic labeling of regular graphs with particular factors ⋮ On $(a,d)$-edge local antimagic coloring number of graphs ⋮ A class of antimagic join graphs ⋮ Antimagic labeling of generalized pyramid graphs ⋮ Caterpillars are antimagic ⋮ On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs ⋮ On Antimagic Labeling for Generalized Web and Flower Graphs ⋮ Unnamed Item ⋮ Partially magic labelings and the antimagic graph conjecture ⋮ Approximate results for rainbow labelings ⋮ Construction of antimagic labeling for the Cartesian product of regular graphs ⋮ Antimagic labelings of caterpillars ⋮ Labelings of plane graphs containing Hamilton path ⋮ Antimagicness of lexicographic product graph \(G[P_n\)] ⋮ Antimagic labelings of join graphs ⋮ The antimagicness of the Cartesian product of graphs

Cites Work

• Unnamed Item
• Lattice grids and prisms are antimagic
• Dense graphs are antimagic
• Combinatorial Nullstellensatz
• Anti‐magic graphs via the Combinatorial NullStellenSatz
• Computing and Combinatorics

This page was built for publication: A new class of antimagic Cartesian product graphs