3 years ago

Antimagic orientations of even regular graphs

Guanghui Wang, Zi‐Xia Song, Tong Li, Donglei Yang, Cun‐Quan Zhang

Abstract

A labeling of a digraph D with m arcs is a bijection from the set of arcs of D to urn:x-wiley:03649024:media:jgt22366:jgt22366-math-0001. A labeling of D is antimagic if no two vertices in D have the same vertex‐sum, where the vertex‐sum of a vertex urn:x-wiley:03649024:media:jgt22366:jgt22366-math-0002 for a labeling is the sum of labels of all arcs entering u minus the sum of labels of all arcs leaving u. Motivated by the conjecture of Hartsfield and Ringel from 1990 on antimagic labelings of graphs, Hefetz, Mütze, and Schwartz [On antimagic directed graphs, J. Graph Theory 64 (2010) 219–232] initiated the study of antimagic labelings of digraphs, and conjectured that every connected graph admits an antimagic orientation, where an orientation D of a graph G is antimagic if D has an antimagic labeling. It remained unknown whether every disjoint union of cycles admits an antimagic orientation. In this article, we first answer this question in the positive by proving that every 2‐regular graph has an antimagic orientation. We then show that for any integer urn:x-wiley:03649024:media:jgt22366:jgt22366-math-0003, every connected, 2d‐regular graph has an antimagic orientation. Our technique is new.

You might also like
Discover & Discuss Important Research

Keeping up-to-date with research can feel impossible, with papers being published faster than you'll ever be able to read them. That's where Researcher comes in: we're simplifying discovery and making important discussions happen. With over 19,000 sources, including peer-reviewed journals, preprints, blogs, universities, podcasts and Live events across 10 research areas, you'll never miss what's important to you. It's like social media, but better. Oh, and we should mention - it's free.

  • Download from Google Play
  • Download from App Store
  • Download from AppInChina

Researcher displays publicly available abstracts and doesn’t host any full article content. If the content is open access, we will direct clicks from the abstracts to the publisher website and display the PDF copy on our platform. Clicks to view the full text will be directed to the publisher website, where only users with subscriptions or access through their institution are able to view the full article.