Aplikace 1-VMV ohodnocení grafů

Abstract

This thesis deals with magic graphs labeling. Thesis sums up basic concepts, known results on 1-VMV graphs and gives some new results for graphs of odd orders, in particular orders for which exist a 14-regular 1-VMV graph of odd order. This result was not known yet. The claim extends related results of other authors 2-, 4-, 6-, 8-, 10-, 12-regular graphs (see articles 1, 2, 3, 4, 5) Thesis results can be used in practice for scheduling of equalized/fair incomplete tournaments which is a problem, that can be, formulated in the language of 1-VMV graphs.