More about edge domination in hyper graph

Abstract

In this paper we further prove more results about edge domination in hypergraphs. In particular we prove necessary & sufficient conditions under which the edge domination number of a hypergraph increases or decreases when a vertex is removed from the hypergraph. We have proved that a subset F of E (G) is an edge dominating set of G iff it is a dominating set in G* (Where G* is dual hypergraph of G) also we have proved that if E (G-v) > E (G) & if F is a minimum edge dominating set of G then there is an edge e containing v  e  F & Prn [e, F] contains two distinct edges.