Antimagic labeling of the lexicographic product graph K_m,n[P_k]

DOI10.1007/S11786-017-0327-ZMaRDI QIDQ1993366zbMATH OpenOpenAlexFDO

Authors Yingyu Lu, Guanghua Dong, Wenhui Ma, Ning Wang

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

antimagic labelinglexicographic product

Mathematics Subject Classification ID

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

Recommendations

• Lexicographic product graphs \(P_m[P_n]\) are antimagic
• Antimagic labelings of join graphs
• An antimagic labeling in \(K_{2n,2n} - nC_4\)
• The antimagicness of the Cartesian product of graphs
• A generalization of magic and antimagic labelings of graphs

Cites work

• A class of antimagic join graphs
• A dynamic survey of graph labeling
• Anti-magic labeling of trees
• Antimagic labeling of regular graphs
• Antimagic labelings of join graphs
• Antimagicness of generalized corona and snowflake graphs
• Benjamin Franklin's Numbers
• Construction of antimagic labeling for the Cartesian product of regular graphs
• Dense graphs are antimagic
• scientific article; zbMATH DE number 47933 (Why is no real title available?)
• On anti-magic labeling for graph products
• On zero-sum partitions and anti-magic trees
• Regular graphs are antimagic

Cited in

(10)

• The antimagicness of the Cartesian product of graphs
• Lexicographic product graphs \(P_m[P_n]\) are antimagic
• Antimagicness of lexicographic product graph \(G[P_n]\)
• Product antimagic labeling of caterpillars
• A generalization of magic and antimagic labelings of graphs
• Antimagic labelings of join graphs
• Lexicographic ordering in graph labellings of cycles paths and complete bipartite graphs
• Graph antimagic labeling: a survey
• 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: Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k]\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1993366)