Construction of antimagic labeling for the Cartesian product of regular graphs
From MaRDI portal
Publication:691635
DOI10.1007/S11786-011-0084-3zbMATH Open1254.05177OpenAlexW2070220611MaRDI QIDQ691635FDOQ691635
Authors: Oudone Phanalasy, Mirka Miller, Costas S. Iliopoulos 
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
Recommendations
Graph operations (line graphs, products, etc.) (05C76) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- On a problem concerning separating systems of a finite set
- Lattice grids and prisms are antimagic
- Dense graphs are antimagic
- Regular bipartite graphs are antimagic
- Title not available (Why is that?)
- Anti‐magic graphs via the Combinatorial NullStellenSatz
- Computing and Combinatorics
- On anti-magic labeling for graph products
- The antimagicness of the Cartesian product of graphs
- A new class of antimagic Cartesian product graphs
- On a relationship between completely separating systems and antimagic labeling of regular graphs
Cited In (7)
- Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k]\)
- Title not available (Why is that?)
- The antimagicness of the Cartesian product of graphs
- A new class of antimagic Cartesian product graphs
- On a relationship between completely separating systems and antimagic labeling of regular graphs
- The Cartesian product of wheel graph and path graph is antimagic
- Anti-magic labelling of Cartesian product of graphs
This page was built for publication: Construction of antimagic labeling for the Cartesian product of regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691635)
