Lexicographic product graphs P_m[P_n] are antimagic
From MaRDI portal
Publication:1713615
Recommendations
Cites work
- A class of antimagic join graphs
- Anti-magic labeling of trees
- Antimagic labeling of generalized pyramid graphs
- Antimagic labeling of regular graphs
- Antimagic labelings of join graphs
- Benjamin Franklin's Numbers
- Dense graphs are antimagic
- scientific article; zbMATH DE number 47933 (Why is no real title available?)
- Local antimagic vertex coloring of a graph
- On anti-magic labeling for graph products
- On antimagic directed graphs
- On zero-sum partitions and anti-magic trees
- Regular graphs are antimagic
Cited in
(8)- Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k]\)
- Antimagicness of lexicographic product graph \(G[P_n]\)
- Bertrand's postulate, the prime number theorem and product anti-magic graphs
- Characterization of product anti-magic graphs of large order
- Lexicographic palindromic products
- The Cartesian product of wheel graph and path graph is antimagic
- Antimagicness of tensor product for some wheel related graphs with star
- The direct product of a star and a path is antimagic
This page was built for publication: Lexicographic product graphs \(P_m[P_n]\) are antimagic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1713615)