A class of antimagic join graphs

DOI10.1007/s10114-012-1559-0zbMath1266.05148OpenAlexW2097491593MaRDI QIDQ1949669

Tao Wang, Deming Li, Ming Ju Liu

Publication date: 14 May 2013

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

Full work available at URL: https://doi.org/10.1007/s10114-012-1559-0

zbMATH Keywords

antimagic labelingjoin graphsantimagic graph

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (5)

A new class of antimagic join graphs ⋮ Lexicographic product graphs \(P_m[P_n\) are antimagic] ⋮ Unnamed Item ⋮ Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k\)] ⋮ Antimagicness of lexicographic product graph \(G[P_n\)]

Cites Work

• Unnamed Item
• A new class of antimagic Cartesian product graphs
• Vertex-magic labelings of regular graphs. II.
• Dense graphs are antimagic
• Regular bipartite graphs are antimagic
• Benjamin Franklin's Numbers
• Anti‐magic graphs via the Combinatorial NullStellenSatz

This page was built for publication: A class of antimagic join graphs