On antimagic labeling of odd regular graphs

DOI10.1007/978-3-642-35926-2_19zbMATH Open1293.05345OpenAlexW15767615MaRDI QIDQ2876571FDOQ2876571

Authors: Tao-Ming Wang, Guanghui Zhang 

Publication date: 19 August 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35926-2_19

Recommendations

• Regular graphs of odd degree are antimagic
• On antimagic labeling of regular graphs with particular factors
• Antimagic labeling of regular graphs
• scientific article; zbMATH DE number 6374002
• Antimagic labeling of biregular bipartite graphs

zbMATH Keywords

Cayley graphgeneralized Petersen graphperfect matching2-factorcirculant graphregular graphantimagic labeling

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (13)

• On antimagic labeling of regular graphs with particular factors
• Antimagic labeling graphs with a regular dominating subgraph
• Construction of antimagic labeling for the Cartesian product of regular graphs
• On $(a,d)$-edge local antimagic coloring number of graphs
• On local edge antimagic chromatic number of graphs
• Antimagic labeling of regular graphs
• Regular graphs are antimagic
• Shifted-antimagic labelings for graphs
• Antimagic labeling of cubic graphs
• Regular graphs of odd degree are antimagic
• An application of the combinatorial nullstellensatz to a graph labelling problem
• Graph antimagic labeling: a survey
• Antimagic orientations of even regular graphs

This page was built for publication: On antimagic labeling of odd regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2876571)