Recommendations
Cites work
Cited in
(39)- On antimagic labeling of regular graphs with particular factors
- Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k]\)
- Generation of anti-magic graphs from binary graph products
- 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
- On edge-graceful labeling and deficiency for regular graphs
- Caterpillars are antimagic
- Sparse graphs with vertex antimagic edge labelings
- Computing and Combinatorics
- Weighted antimagic labeling: an algorithmic approach
- scientific article; zbMATH DE number 2208450 (Why is no real title available?)
- An antimagic labeling in \(K_{2n,2n} - nC_4\)
- 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
- On edge-graceful regular graphs with particular 3-factors
- Computing edge weights of magic labeling on rooted products of graphs
- Labeling trees of small diameters with consecutive integers
- Bertrand's postulate, the prime number theorem and product anti-magic graphs
- Graph antimagic labeling: a survey
- 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)
