On anti-magic labeling for graph products

From MaRDI portal
Publication:932686

DOI10.1016/j.disc.2007.07.027zbMath1155.05055OpenAlexW2040151942MaRDI QIDQ932686

Cheng-Chih Hsiao, Tao-Ming Wang

Publication date: 11 July 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.027




Related Items (26)

Antimagic labelling of vertex weighted graphsOn edge-graceful labeling and deficiency for regular graphsWeighted antimagic labeling: an algorithmic approachGraphs admitting antimagic labeling for arbitrary sets of positive integersOn edge-graceful regular graphs with particular 3-factorsGraphs admitting antimagic labeling for arbitrary sets of positive numbersOn antimagic labeling of regular graphs with particular factorsLabeling trees of small diameters with consecutive integersWeighted-1-antimagic graphs of prime power orderLexicographic product graphs \(P_m[P_n\) are antimagic] ⋮ Caterpillars are antimagicOn a Relationship between Completely Separating Systems and Antimagic Labeling of Regular GraphsAn antimagic labeling inK2n,2nnC4Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k\)] ⋮ Weighted antimagic labelingApproximate results for rainbow labelingsConstruction of antimagic labeling for the Cartesian product of regular graphsComputing edge weights of magic labeling on rooted products of graphsAntimagic labelings of caterpillarsAntimagicness of generalized corona and snowflake graphsAntimagicness of lexicographic product graph \(G[P_n\)] ⋮ Antimagic labeling and canonical decomposition of graphsAntimagic labelings of join graphsShifted-antimagic labelings for graphsAntimagic labeling of forests with sets of consecutive integersOn 3-total edge product cordial labeling of grid




Cites Work




This page was built for publication: On anti-magic labeling for graph products