The antimagicness of the Cartesian product of graphs

DOI10.1016/J.TCS.2008.10.023zbMath1162.05042OpenAlexW2056267215MaRDI QIDQ1006045

Yuchen Zhang, Xiaoming Sun

Publication date: 17 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.10.023

zbMATH Keywords

regular graphCartesian productantimagic labeling

Mathematics Subject Classification ID

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

Related Items (13)

On edge-graceful labeling and deficiency for regular graphs ⋮ On antimagic labeling of regular graphs with particular factors ⋮ Antimagic labeling of generalized pyramid graphs ⋮ Unnamed Item ⋮ Caterpillars are antimagic ⋮ On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs ⋮ Approximate results for rainbow labelings ⋮ Construction of antimagic labeling for the Cartesian product of regular graphs ⋮ Antimagic labelings of caterpillars ⋮ Antimagicness of generalized corona and snowflake graphs ⋮ Antimagicness of lexicographic product graph \(G[P_n\)] ⋮ Antimagic labelings of join graphs ⋮ Antimagic Labeling of Cubic Graphs

Cites Work

• Unnamed Item
• A new class of antimagic Cartesian product graphs
• Lattice grids and prisms are antimagic
• Dense graphs are antimagic
• Anti‐magic graphs via the Combinatorial NullStellenSatz
• Computing and Combinatorics

This page was built for publication: The antimagicness of the Cartesian product of graphs