Volume 44 | Number 3 | Year 2017 | Article Id. IJMTT-V44P521 | DOI : https://doi.org/10.14445/22315373/IJMTT-V44P521
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 an edge is added or removed from the hypergraph. We have proved thatif 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 also we have proved that if E(G + h) <E(G) then there are at least two vertices x & y in h all the edges containing x or y except h are in the complement of F. Where F is any minimum edge dominating set of G + h.
[1] Acharya B., Domination in Hypergraphs, AKCE J. Graphs. Combin., 4, NO. 2(2007) 111 – 126
[2] Behr A., Camarinopoulos L., On the domination of hypergraphs by their edges, Discrete Mathematics,187(1998), 31 - 38
[3] Berge C.,Graphs and Hypergraphs, North-Holland, Amsterdam (1973)
[4] Berge C., Hypergraphs, North – Holland Mathematical Library, New York, Volume – 45 (1989)
[5] Haynes T., Hedetniemi S. and Slater P., Domination in Graphs Advanced Topics, Marcel Dekker, Inc., New York, (1998).
[6] Haynes T., Hedetniemi S. and Slater P., Fundamental of Domination in Graphs, Marcel Dekker, Inc., New York, (1998) [7] Thakkar D.and Dave V., Edge Domination in Hypergraph, Communicated for publication.
[8] Thakkar D.and Dave V., More aboutEdge Domination in Hypergraph, Communicated for publication.
[9] Thakkar D.and Kothiya A., Uniqueness of c – Partition of a Graph,IJMTT, Vol. – 33(1)(2016) 16 – 18.
[10] Thakkar D.and Badiyani S., Edge deletion & Restrained Sets in Graphs, IJMTT, Vol. – 37(4)(2016) 260 – 262.
D. K. Thakkar, V. R. Dave, "Regarding Edge Domination in Hypergraph," International Journal of Mathematics Trends and Technology (IJMTT), vol. 44, no. 3, pp. 108-114, 2017. Crossref, https://doi.org/10.14445/22315373/IJMTT-V44P521