Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k]\)

DOI10.1007/s11786-017-0327-zzbMath1402.05185OpenAlexW2773416112MaRDI QIDQ1993366

Yingyu Lu, Ning Wang, Wenhui Ma, Guanghua Dong

Publication date: 5 November 2018

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-017-0327-z

zbMATH Keywords

lexicographic productantimagic labeling

Mathematics Subject Classification ID

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
• Construction of antimagic labeling for the Cartesian product of regular graphs
• Regular graphs are antimagic
• On anti-magic labeling for graph products
• On zero-sum partitions and anti-magic trees
• A dynamic survey of graph labeling
• A class of antimagic join graphs
• Antimagicness of generalized corona and snowflake graphs
• Antimagic labelings of join graphs
• Dense graphs are antimagic
• Antimagic Labeling of Regular Graphs
• Benjamin Franklin's Numbers

This page was built for publication: Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k]\)