References

Harary, F., 1969. Proof Techniques in Graph Theory. Academic Press, Cambridge, Massachusetts, Pages: 330.

Haynes, T.W., S.T. Hedetniemi and P.J. Slater, 1998. Domination in Graphs-Advanced Topics. Marcel Dekker Inc., New York, USA.,.

Haynes, T.W., S.T. Hedetniemi and P.J. Slater, 1998. Fundamentals of Domination in Graphs. Marcel Dekker Inc., New York, USA., ISBN:0-8247-0033-3, Pages: 443.

Kiunisala, E.M., 2016. Inverse closed domination in graphs. Global J. Pure Appl. Math., 12: 1845-1851.

Kulli, V.R. and S.C. Sigarkanti, 1991. Inverse domination in graphs. Nat. Acad. Sci. Lett., 14: 473-475.

Omran, A.A. and M.N.A. Harere, 2016. Some properties of chromatic, domination and independence numbers of a graph. AlBahir J., 3: 27-33.

Omran, A.A. and M.N.A. Harere, 2017. Edge domination in web graph. Proceedings of the 10th International Scientific Conference on Education College, April 11-14, 2017, University of Wasit, Kut, Iraq, pp: 1403-1410.

Ore, O., 1962. Theory of Graphs. Vol. 38, American Mathematical Society Publisher, Providence, Rhode Island, ISBN:978-0-8218-1038-5, Pages: 270.

Sampathkumar, E. and H.B. Walikar, 1979. The connected domination number of a graph. J. Math. Phys. Sci., 13: 607-613.
Direct Link  |  

Sampathkumar, E. and P.S. Neeralagi, 1985. The neighborhood number of a graph. Indian J. Pure Appl. Math., 16: 126-132.

Walikar, H.B., B.D. Acharya and E. Sampathkumar, 1979. Recent Developments in the Theory of Domination in Graphs and its Applications. Harish-Chandra Research Institute, Allahabad, India, Pages: 241.