Author:
Bhangale Shilpa T.,Pawar Madhukar M.
Abstract
In this note we provide a solution to the problem “Find a structural characterization of cubic graph for which the isolate domination number equals one plus its domination number.” We show that if G is a cubic graph of order n and if 6 | n, then the isolate domination number of G is the same as the domination number of G. We also prove that if G is a connected cubic graph with diam(G) > 2, then the isolate domination number is the same as the domination number.
Publisher
Informatics Publishing Limited
Reference9 articles.
1. C. Berge, Theorie des graphes et ses applications, ,Collection Universitaire de Mathematiques, Dunod, Paris, 1958.
2. C. Berge, Theory of Graphs and its Applications , Methuen, London, 1962.
3. S. T. Bhangale and M. M. Pawar, Isolate and independent domination number of some classes of graphs , AKCE Int. J. of Graphs and Combinatorics, 16 (2019), 110–115.
4. I. S. Hamid and S. Balamurugam, Isolate domination in graphs Arab J. Maths. Sci., 22 (2015), 232–241.
5. F. Harary, Graph theory, Addison-Wesley Publishing Company, Inc 1969.