Lexicographic product graphs \(P_m[P_n]\) are antimagic

DOI10.1016/j.akcej.2017.10.005zbMath1403.05129OpenAlexW2775050868MaRDI QIDQ1713615

Ning Wang, Wenhui Ma, Yingyu Lu, Guanghua Dong

Publication date: 25 January 2019

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2017.10.005

zbMATH Keywords

pathlexicographic productantimagic graph

Mathematics Subject Classification ID

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

Related Items (1)

Antimagicness of lexicographic product graph \(G[P_n\)]

Cites Work

• Unnamed Item
• Anti-magic labeling of trees
• Regular graphs are antimagic
• On anti-magic labeling for graph products
• On zero-sum partitions and anti-magic trees
• A class of antimagic join graphs
• Local antimagic vertex coloring of a graph
• Antimagic labeling of generalized pyramid graphs
• Antimagic labelings of join graphs
• On antimagic directed graphs
• Dense graphs are antimagic
• Antimagic Labeling of Regular Graphs
• Benjamin Franklin's Numbers

This page was built for publication: Lexicographic product graphs \(P_m[P_n]\) are antimagic