On antimagic labeling of regular graphs with particular factors
From MaRDI portal
Publication:396690
DOI10.1016/j.jda.2013.06.008zbMath1334.05157OpenAlexW2021192579MaRDI QIDQ396690
Tao-Ming Wang, Guang-Hui Zhang
Publication date: 13 August 2014
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2013.06.008
Cayley graph2-factor1-factorregular graphperfect matchinggeneralized Petersen graphantimagic labelingclaw-factor
Related Items (2)
On edge-graceful labeling and deficiency for regular graphs ⋮ On edge-graceful regular graphs with particular 3-factors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weighted-1-antimagic graphs of prime power order
- On anti-magic labeling for graph products
- Antimagic labeling and canonical decomposition of graphs
- A new class of antimagic Cartesian product graphs
- A note on edge-graceful spectra of the square of paths
- The antimagicness of the Cartesian product of graphs
- Lattice grids and prisms are antimagic
- On Antimagic Labeling of Odd Regular Graphs
- Antimagic labelling of vertex weighted graphs
- On antimagic directed graphs
- An Application of the combinatorial Nullstellensatz to a graph labelling problem
- Dense graphs are antimagic
- Regular bipartite graphs are antimagic
- Anti‐magic graphs via the Combinatorial NullStellenSatz
- Computing and Combinatorics
This page was built for publication: On antimagic labeling of regular graphs with particular factors
