Construction of antimagic labeling for the Cartesian product of regular graphs
From MaRDI portal
(Redirected from Publication:691635)
Recommendations
Cites work
- scientific article; zbMATH DE number 47933 (Why is no real title available?)
- A new class of antimagic Cartesian product graphs
- Anti‐magic graphs via the Combinatorial NullStellenSatz
- Computing and Combinatorics
- Dense graphs are antimagic
- Lattice grids and prisms are antimagic
- On a problem concerning separating systems of a finite set
- On a relationship between completely separating systems and antimagic labeling of regular graphs
- On anti-magic labeling for graph products
- Regular bipartite graphs are antimagic
- The antimagicness of the Cartesian product of graphs
Cited in
(7)- Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k]\)
- scientific article; zbMATH DE number 7567431 (Why is no real title available?)
- 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)