The antimagicness of the Cartesian product of graphs

DOI10.1016/J.TCS.2008.10.023zbMATH Open1162.05042OpenAlexW2056267215MaRDI QIDQ1006045FDOQ1006045

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

Cartesian productregular graphantimagic labeling

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Lattice grids and prisms are antimagic
• Dense graphs are antimagic
• Anti‐magic graphs via the Combinatorial NullStellenSatz
• Computing and Combinatorics
• A new class of antimagic Cartesian product graphs

Cited In (15)

• On antimagic labeling of regular graphs with particular factors
• Antimagicness of generalized corona and snowflake graphs
• Construction of antimagic labeling for the Cartesian product of regular graphs
• Antimagic labelings of caterpillars
• Antimagic labeling of generalized pyramid graphs
• Antimagic labelings of join graphs
• Antimagicness of lexicographic product graph \(G[P_n]\)
• Caterpillars are antimagic
• On edge-graceful labeling and deficiency for regular graphs
• Antimagic labeling of cubic graphs
• On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs
• On the zero-sum group-magicness of Cartesian products
• Bertrand's postulate, the prime number theorem and product anti-magic graphs
• Title not available (Why is that?)
• Approximate results for rainbow labelings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1006045)