[1] B.D. Acharya, Domination in Hypergraphs, AKCE Int. J. Graphs Combin., 4(2) (2007), 117-126.
[2] B.D. Acharya, Domination in hypergraphs: II-New Directions, Proc. Int. Conf. ICDM, (2008), 1-16.
[3] C. Berge Theory of Graphs and its Applications, Methuen, London, (1962 ).
[4] C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, (1973).
[5] C. Berge, Hypergraphs, Combinatorics of Finite Sets, North-Holland, Amsterdam, (1989).
[6] Bibin K. Jose, Zs. Tuza, Hypergraph Domination and Strong Independence, Appl. Anal. Discrete Math., 3 (2009), 347358.
[7] Haynes T.W., Hedetniemi S.T. and Slater P.J. Domination in Graphs-Advanced Topics, New York : Dekker, (1998).
[8] Haynes T.W., Hedetniemi S.T. and Slater P.J. Fundamentals of Domination in Graphs, New York: Dekker (1998).
[9] Megha M. Jadhav and Kishor F. Pawar, On Edge Product Hypergraphs, Journal of Hyperstructures, 10(1) (2021), 1-12.
[10] F. Jaeger and C. Payan, Relations du type Nordhaus-Gaddum pour le nombre d absorption dun graphe simple, C.R. Acad. Sci., Paris, 274 (1972), 728730.
[11] E. A. Nordhaus and J. W. Gaddum, On complementary Graphs, Amer. Math. Monthly, 63 (1956), 175177.
[12] O. Ore, Theory of Graphs, Amer. Math. Soc. Trans., Vol. 38 Amer. Math. Soc., providence, RI, (1962), 206-212.