• EDGE h - DOMINATION IN HYPERGRAPH

D. K. THAKKAR*, V. R. DAVE

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.


Keywords


Hypergraph, Edge h - Dominating Set in Hypergraph, Minimal Edge h - Dominating Set, Minimum Edge h - Dominating Set, Edge h - Domination Number, Edge Dominating Set, Edge Domination Number, Sub Hypergraph, Partial Sub Hypergraph.

Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 Unported License.
© 2010-2016 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
Web Counter