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

DOI10.1007/s10255-020-0953-0zbMath1462.05319OpenAlexW3082562165MaRDI QIDQ2023731

Yingyu Lu, Ning Wang, Guanghua Dong

Publication date: 3 May 2021

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-020-0953-0

zbMATH Keywords

labelinglexicographic productantimagic

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Anti-magic labeling of trees
• On anti-magic labeling for graph products
• A new class of antimagic Cartesian product graphs
• The antimagicness of the Cartesian product of graphs
• On zero-sum partitions and anti-magic trees
• A dynamic survey of graph labeling
• Lexicographic product graphs \(P_m[P_n\) are antimagic]
• Anti-magic labelling of Cartesian product of graphs
• A class of antimagic join graphs
• Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k\)]
• 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: Antimagicness of lexicographic product graph \(G[P_n]\)