01043862

j

01043862 Acharya, B.Devadas Full sets in hypergraphs. Sankhy\=a, Ser. A 54, Spec. Vol., 1-6 (1992). 1992 Indian Statistical Institute, Calcutta EN hypergraph full sets domination number Summary: A set $S$ of vertices in a hypergraph $H=(X,{\cal E})$ is called full if no edge of $H$ that intersects $S$ is contained in $S$ properly. This generalises the notion of full sets in graphs investigated by E. Sampathkumar. In this paper, we obtain generalisations of several known results in graph theory, especially the ``Gallai theorems'' and results on the relationships between the domination number and the full number of hypergraphs.