Vrcholově magická ohodnocení grafů

Abstract

This thesis deals with finding a certain magic labeling of graphs, namely 1-VMV labeling, also called distance magic labeling. Thesis extends known results in this area by a new construction of 1-VMV labeling usable for certain kind of graphs for which this labeling was not known yet. Thesis points out the possibility of practical application of theoretical results on the example of scheduling tournaments. The scheduling of a so called fair incomplete tournament is incentive problem of some articles, from which this work draws. This problem can be reformulated as finding a 1-VMV labeling of regular graph.