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
- 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
- scientific article; zbMATH DE number 47933 (Why is no real title available?)
- On zero-sum partitions and anti-magic trees
- Regular bipartite graphs are antimagic
- Regular graphs of odd degree are antimagic
Cited in
(72)- Antimagic orientation of biregular bipartite graphs
- Lexicographic product graphs \(P_m[P_n]\) are antimagic
- Partially magic labelings and the antimagic graph conjecture
- A generalized version of a local antimagic labelling conjecture
- Anti-magic labelling of Cartesian product of graphs
- Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k]\)
- Caterpillars with maximum degree 3 are antimagic
- Antimagic orientation of lobsters
- Antimagic orientations of graphs with large maximum degree
- Antimagic labelings of caterpillars
- Antimagicness of generalized corona and snowflake graphs
- Antimagicness of lexicographic product graph \(G[P_n]\)
- Combinatorial configurations in the definition of antimagic labelings of graphs
- Shifted-antimagic labelings for graphs
- Product antimagic labeling of caterpillars
- Antimagic labeling of forests with sets of consecutive integers
- Antimagic labeling of biregular bipartite graphs
- Antimagic labeling of some biregular bipartite graphs
- A note on additive choice number of planar graphs
- Local antimagic orientation of graphs
- Graphs admitting antimagic labeling for arbitrary sets of positive numbers
- Caterpillars are antimagic
- Antimagic orientations for the complete \(k\)-ary trees
- Antimagic orientations of disconnected even regular graphs
- A note on antimagic orientations of even regular graphs
- Antimagic orientation of Halin graphs
- Graphs admitting antimagic labeling for arbitrary sets of positive integers
- Antimagic labeling of generalized pyramid graphs
- Antimagic orientations of graphs with given independence number
- Antimagic labeling for unions of graphs with many three-paths
- An application of completely separating systems to graph labeling
- Antimagic labeling of cubic graphs
- On antimagic labeling of odd regular graphs
- scientific article; zbMATH DE number 6374002 (Why is no real title available?)
- Regular graphs of odd degree are antimagic
- Anti-magic labellings of a class of planar graphs
- scientific article; zbMATH DE number 5178693 (Why is no real title available?)
- Regular bipartite graphs are antimagic
- On antimagic labeling of regular graphs with particular factors
- List-antimagic labeling of vertex-weighted graphs
- Multi-bridge graphs are anti-magic
- Face antimagic labelings of toroidal and Klein bottle grid graphs
- Antimagic orientations of even regular graphs
- scientific article; zbMATH DE number 5026374 (Why is no real title available?)
- scientific article; zbMATH DE number 2208450 (Why is no real title available?)
- Computing and Combinatorics
- Antimagic orientation of graphs with minimum degree at least 33
- Antimagic orientation of forests
- Labeling trees of small diameters with consecutive integers
- scientific article; zbMATH DE number 7714106 (Why is no real title available?)
- Generation of anti-magic graphs from binary graph products
- Approaches that output infinitely many graphs with small local antimagic chromatic number
- Antimagic labeling of forests
- Finding Antimagic Labelings of Trees by Evolutionary Search
- Graph antimagic labeling: a survey
- On vertex in-out-antimagic total digraphs
- On local antimagic chromatic number of cycle-related join graphs. II
- On \(k\)-shifted antimagic spider forests
- Antimagic labeling for subdivisions of graphs
- Constructing the antimagic labelings for double stars union paths on three vertices
- Antimagic graph constructions with triangle and three-path unions
- The antimagic orientations for graphs obtained by some graph operations
- On the study of rainbow antimagic connection number of comb product of tree and complete bipartite graph
- Antimagic labelings of line graphs and sequential generalized edge corona of graphs
- Antimagic labeling of subdivided caterpillars
- A note on \({\mathtt V}\)-free 2-matchings
- Beyond biregular: antimagicness of uni-regular bipartite graphs
- Bipartite graphs with minimum degree at least 15 are antimagic
- Construction of the 1-skeleton of the A₄-structure of a graph with antimagic labeling and its application to social network analysis
- Antimagic orientation of subdivided caterpillars
- Regular graphs are antimagic
- Magic labelings of regular graphs
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)
