Author:
Novak Tina,Žerovnik Janez
Funder
Javna Agencija za Raziskovalno Dejavnost RS
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Control and Optimization,Computer Science Applications,Economics, Econometrics and Finance (miscellaneous)
Reference17 articles.
1. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, San Francisco
2. Cockayne E, Goodman S, Hedetniemi S (1975) A linear algorithm for the domination number o a tree. Inf Process Lett 4:41–44
3. Haynes TW, Hedetniemi S, Slater P (1998) Fundamentals of domination in graphs. Marcel Dekker, New York
4. Hajian M, Henning MA, Rad NJ (2019) A new lower bound on the domination number of a graph. J Comb Optim 38:721–738
5. Ouldrabah L, Blidia M, Bouchou A (2019) On the $$k$$-domination number of digraphs. J Comb Optim 38:680–688