A new class of antimagic Cartesian product graphs
From MaRDI portal
(Redirected from Publication:998385)
Recommendations
Cites work
Cited in
(29)- The antimagicness of the Cartesian product of graphs
- On edge-graceful labeling and deficiency for regular graphs
- Lexicographic product graphs \(P_m[P_n]\) are antimagic
- Partially magic labelings and the antimagic graph conjecture
- Anti-magic labelling of Cartesian product of graphs
- A class of antimagic join graphs
- Antimagic labelings of caterpillars
- Antimagicness of lexicographic product graph \(G[P_n]\)
- Caterpillars are antimagic
- Antimagic labeling of generalized pyramid graphs
- Bertrand's postulate, the prime number theorem and product anti-magic graphs
- Antimagic labelings of join graphs
- A new class of antimagic join graphs
- On a relationship between completely separating systems and antimagic labeling of regular graphs
- On antimagic labeling for generalized web and flower graphs
- An antimagic labeling in \(K_{2n,2n} - nC_4\)
- On antimagic labeling of regular graphs with particular factors
- Super-edge magic total labeling in certain classes of graphs
- On local edge antimagic chromatic number of graphs
- On $(a,d)$-edge local antimagic coloring number of graphs
- Approximate results for rainbow labelings
- Labelings of plane graphs containing Hamilton path
- Computing and Combinatorics
- The Cartesian product of wheel graph and path graph is antimagic
- Graph antimagic labeling: a survey
- D-antimagic labelings arising from completely separating systems
- The direct product of a star and a path is antimagic
- Construction of antimagic labeling for the Cartesian product of regular graphs
- On anti-magic labeling for graph products
This page was built for publication: A new class of antimagic Cartesian product graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998385)