On anti-magic labeling for graph products
From MaRDI portal
Publication:932686
DOI10.1016/J.DISC.2007.07.027zbMATH Open1155.05055OpenAlexW2040151942MaRDI QIDQ932686FDOQ932686
Authors: Tao-Ming Wang, Cheng-Chih Hsiao 
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
Recommendations
Cites Work
Cited In (39)
- On antimagic labeling of regular graphs with particular factors
- Generation of anti-magic graphs from binary graph products
- Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k]\)
- Antimagicness of generalized corona and snowflake graphs
- Antimagic labeling and canonical decomposition of graphs
- Construction of antimagic labeling for the Cartesian product of regular graphs
- Antimagic labelings of caterpillars
- Dense graphs are antimagic
- The antimagicness of the Cartesian product of graphs
- A new class of antimagic Cartesian product graphs
- Antimagic labelings of join graphs
- Weighted-1-antimagic graphs of prime power order
- Characterization of product anti-magic graphs of large order
- Antimagic labeling of forests with sets of consecutive integers
- On 3-total edge product cordial labeling of grid
- Antimagicness of lexicographic product graph \(G[P_n]\)
- On a relationship between completely separating systems and antimagic labeling of regular graphs
- Caterpillars are antimagic
- On edge-graceful labeling and deficiency for regular graphs
- Computing and Combinatorics
- Sparse graphs with vertex antimagic edge labelings
- Title not available (Why is that?)
- An antimagic labeling in \(K_{2n,2n} - nC_4\)
- Weighted antimagic labeling: an algorithmic approach
- Shifted-antimagic labelings for graphs
- Graphs admitting antimagic labeling for arbitrary sets of positive integers
- Antimagicness of tensor product for some wheel related graphs with star
- Anti-magic labelling of Cartesian product of graphs
- Graphs admitting antimagic labeling for arbitrary sets of positive numbers
- Antimagic labelling of vertex weighted graphs
- Weighted antimagic labeling
- Labeling trees of small diameters with consecutive integers
- On edge-graceful regular graphs with particular 3-factors
- Computing edge weights of magic labeling on rooted products of graphs
- Graph antimagic labeling: a survey
- Bertrand's postulate, the prime number theorem and product anti-magic graphs
- Multi-bridge graphs are anti-magic
- Lexicographic product graphs \(P_m[P_n]\) are antimagic
- Approximate results for rainbow labelings
This page was built for publication: On anti-magic labeling for graph products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q932686)
