Graphs achieving the equality in vizing\u27s conjecture

Vizing je leta 1968 postavil domnevo, da je dominantno število kartezičnega produkta dveh grafov večje ali enako produktu njunih dominantnih števil. V magistrskem delu obravnavamo družine grafov, ki v tej domnevi dosežejo enakost. V prvem delu magistrske naloge smo navedli pojme in trditve, ki jih potrebujemo za razumevanje glavnega problema naloge. Drugo poglavje se nanaša na različne meje dominantnega števila kartezičnega produkta dveh grafov in družine grafov, ki zadoščajo Vizingovi domnevi. V tretjem poglavju obravnavamo družine grafov, ki pod določenimi pogoji dosežejo enakost v Vizingovi domnevi, ter znane rezultate podamo v tabeli.In 1963, Vizing conjectured that the domination number of the Cartesian product of two graphs is greater or equal to the product of their domination numbers. In this master’s thesis, we discuss graph classes that achieve equality in this conjecture. In the first part, we list all the necessary definitions and theorems that are needed for understanding the main problem of the thesis. In the second part, we present different bounds for the domination number of the Cartesian product of two graphs and graph classes that satisfy Vizing’s conjecture. In the third part, we study graph classes that under various conditions satisfy the equality in Vizing’s conjecture and present known results in a table