Handicap Labelings of 4-Regular Graphs

• Main Authors: Petr Kovar, Michal Kravcenko, Matej Krbecek, Adam Silber
• Format: Article
• Language: English
• Published: VSB-Technical University of Ostrava 2017-01-01
• Series: Advances in Electrical and Electronic Engineering
• Subjects: scheduling; tournament; regular graph; handicap labeling.
• Online Access: http://advances.utc.sk/index.php/AEEE/article/view/2263
• ISSN: 1336-1376; 1804-3119

Let G be a simple graph, let <i> f : V(G)&#8594{1,2,...,|V(G)|}</i> be a bijective mapping. The weight of <i>v &#8712 V(G)</i> is the sum of labels of all vertices adjacent to <i>v</i>. We say that <i>f</i> is a distance magic labeling of <i>G</i> if the weight of every vertex is the same constant <i>k</i> and we say that <i>f</i> is a handicap magic labeling of <i>G</i> if the weight of every vertex <i>v</i> is <i>l + f(v)</i> for some constant l. Graphs that allow such labelings are called distance magic or handicap, respectively. Distance magic and handicap labelings of regular graphs are used for scheduling incomplete tournaments. While distance magic labelings correspond to so called equalized tournaments, handicap labelings can be used to schedule incomplete tournaments that are more challenging to stronger teams or players, hence they increase competition and yield attractive schemes in which every games counts. We summarize known results on distance magic and handicap labelings and construct a new infinite class of 4-regular handicap graphs.