Antimagic labeling of regular graphs
From MaRDI portal
Abstract: A graph is antimagic if there is a one-to-one correspondence such that for any two vertices , . It is known that bipartite regular graphs are antimagic and non-bipartite regular graphs of odd degree at least three are antimagic. Whether all non-bipartite regular graphs of even degree are antimagic remained an open problem. In this paper, we solve this problem and prove that all even degree regular graphs are antimagic. The paper was submitted to December 2014 by Journal of Graph Theory.
Recommendations
Cites work
- scientific article; zbMATH DE number 47933 (Why is no real title available?)
- Anti-magic labeling of trees
- Anti-magic labelling of Cartesian product of graphs
- Antimagic labeling of cubic graphs
- Anti‐magic graphs via the Combinatorial NullStellenSatz
- Dense graphs are antimagic
- On zero-sum partitions and anti-magic trees
- Regular bipartite graphs are antimagic
- Regular graphs of odd degree are antimagic
Cited in
(69)- Antimagic orientations of even regular graphs
- On vertex in-out-antimagic total digraphs
- On antimagic labeling of regular graphs with particular factors
- Antimagic orientation of subdivided caterpillars
- 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
- On local antimagic chromatic number of cycle-related join graphs. II
- Antimagic orientation of graphs with minimum degree at least 33
- Antimagic labeling of biregular bipartite graphs
- Caterpillars with maximum degree 3 are antimagic
- Antimagic labelings of caterpillars
- On the study of rainbow antimagic connection number of comb product of tree and complete bipartite graph
- Antimagic labeling of generalized pyramid graphs
- scientific article; zbMATH DE number 5178693 (Why is no real title available?)
- Local antimagic orientation of graphs
- Partially magic labelings and the antimagic graph conjecture
- Regular bipartite graphs are antimagic
- Antimagic labelings of line graphs and sequential generalized edge corona of graphs
- Product antimagic labeling of caterpillars
- Antimagic orientation of biregular bipartite graphs
- An application of completely separating systems to graph labeling
- A generalized version of a local antimagic labelling conjecture
- Antimagic labeling of forests with sets of consecutive integers
- Antimagic orientation of lobsters
- Antimagic orientations of graphs with large maximum degree
- Face antimagic labelings of toroidal and Klein bottle grid graphs
- Antimagicness of lexicographic product graph \(G[P_n]\)
- On antimagic labeling of odd regular graphs
- A note on \({\mathtt V}\)-free 2-matchings
- Caterpillars are antimagic
- Antimagic orientations for the complete \(k\)-ary trees
- Antimagic labeling of subdivided caterpillars
- Regular graphs are antimagic
- Computing and Combinatorics
- Antimagic orientations of disconnected even regular graphs
- A note on antimagic orientations of even regular graphs
- Antimagic orientation of Halin graphs
- Antimagic labeling of some biregular bipartite graphs
- On \(k\)-shifted antimagic spider forests
- List-antimagic labeling of vertex-weighted graphs
- Approaches that output infinitely many graphs with small local antimagic chromatic number
- scientific article; zbMATH DE number 5026374 (Why is no real title available?)
- scientific article; zbMATH DE number 2208450 (Why is no real title available?)
- Antimagic orientations of graphs with given independence number
- Combinatorial configurations in the definition of antimagic labelings of graphs
- Shifted-antimagic labelings for graphs
- scientific article; zbMATH DE number 7714106 (Why is no real title available?)
- Antimagic orientation of forests
- Antimagic labeling of cubic graphs
- Graphs admitting antimagic labeling for arbitrary sets of positive integers
- Finding Antimagic Labelings of Trees by Evolutionary Search
- Constructing the antimagic labelings for double stars union paths on three vertices
- A note on additive choice number of planar graphs
- scientific article; zbMATH DE number 6374002 (Why is no real title available?)
- Regular graphs of odd degree are antimagic
- Anti-magic labelling of Cartesian product of graphs
- Antimagic labeling of forests
- Graphs admitting antimagic labeling for arbitrary sets of positive numbers
- Magic labelings of regular graphs
- Antimagic graph constructions with triangle and three-path unions
- Anti-magic labellings of a class of planar graphs
- Antimagic labeling for subdivisions of graphs
- Labeling trees of small diameters with consecutive integers
- Antimagic labeling for unions of graphs with many three-paths
- Graph antimagic labeling: a survey
- The antimagic orientations for graphs obtained by some graph operations
- Multi-bridge graphs are anti-magic
- Lexicographic product graphs \(P_m[P_n]\) are antimagic
This page was built for publication: Antimagic labeling of regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3188668)
