





A Note on Isolate Domination Number of a Cubic Graph
Subscribe/Renew Journal
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.
Keywords
Domination Number, Isolate Domination Number, Total Domination Number, Cubic Graphs, Private Neighbour.
Subscription
Login to verify subscription
User
Font Size
Information