Thesis supervisor: Zsolt Tuza
co-supervisor: Csilla Bujtás
Location of studies (in Hungarian): University of Pannonia, Department of Computer Science and Systems Technology Abbreviation of location of studies: PE
Description of the research topic:
Independence and covering are basic concepts in combinatorics, they are closely related to many optimization problems. One of the corresponding graph invariants is the domination number, which is the minimum cardinality of a vertex set D subset of V(G) such that each vertex of G can be directly reached from D. For graphs, several variants of the domination number have been studied extensively, but the corresponding parameter for hypergraphs was defined only some years ago. Various open problems are related to applications in information technology.
Preliminary results can be found in the following publications:
[1] T. W. Haynes, S. T. Hedetniemi, P. J. Slater (eds), Fundamentals of Domination in Graphs. Marcel Dekker, Inc. New York, 1998.
[2] Cs. Bujtás, M. A. Henning, Zs. Tuza: Transversals and domination in uniform hypergraphs. European Journal of Combinatorics, 33 (2012), 62–71.
[3] M. A. Henning, A. Yeo: Total Domination in Graphs. Springer Monographs in Mathematics, Springer, 2013.
Login
