Domination and total domination in Fibonacci and Lucas cubes

V delu obravnavamo problem dominantnega in celotnega dominantnega števila Fibonaccijevih in Lucasovih kock. Formula za te štiri probleme zaenkrat še ne obstajajo. V delu pa je narejena analiza trenutnih rezultatov za spodnje in zgornje meje. Spoznamo tudi izboljšavo rezultatov s pomočjo linearnega programiranja in soroden problem 2-pakirnega števila.In the work we discuss the problem of the domination and the total domination number of Fibonacci and Lucas cubes. The exact formulas for these four problems currently do not exist. The work thus includes an analysis of lower and upper bounds. We also present the improved results obtained with the use of linear programming and a related problem of the 2-packing number