• EDGE h - DOMINATION IN HYPERGRAPH

Abstract

In this paper we introduce a new concept called edge h – domination in hypergraphs. Every edge h – dominating set is an edge dominating set but converse is not true. We characterize minimal edge h – dominating set in hypergraphs. It is also proved that the edge h – domination number does not decrease when a vertex is removed from the hypergraph and the subhypergraph obtained by removing the vertex from the hypergraph is considered. We also prove corresponding results for the partial subhypergraph obtained by removing a vertex from the hypergraph.