Construction of antimagic labeling for the Cartesian product of regular graphs

DOI10.1007/s11786-011-0084-3zbMath1254.05177OpenAlexW2070220611MaRDI QIDQ691635

Costas S. Iliopoulos, Mirka Miller, Oudone Phanalasy

Publication date: 3 December 2012

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

Full work available at URL: https://doi.org/10.1007/s11786-011-0084-3

zbMATH Keywords

regular graphCartesian product of graphsantimagic graph labelingcompletely separating systems

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k\)]

Cites Work

• Unnamed Item
• On anti-magic labeling for graph products
• A new class of antimagic Cartesian product graphs
• The antimagicness of the Cartesian product of graphs
• Lattice grids and prisms are antimagic
• On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs
• Dense graphs are antimagic
• Regular bipartite graphs are antimagic
• On a problem concerning separating systems of a finite set
• Anti‐magic graphs via the Combinatorial NullStellenSatz
• Computing and Combinatorics

This page was built for publication: Construction of antimagic labeling for the Cartesian product of regular graphs