Share Your Research, Maximize Your Social Impacts
On disconnected domination number of a graph
Journal: International Journal of Mathematics and Soft Computing (Vol.3, No. 2)Publication Date: 2013-05-28
Authors : S. Balamurugan G. Prabakaran;
Page : 17-20
Keywords : Domination; disconnected domination; independence number; disconnected domination number.;
Source : Download
Find it from : Google Scholar
Abstract
A dominating set D of graph G = (V, E) is a disconnected dominating set, if the induced subgraph < D > is disconnected. The disconnected dominating number (G) of G is the minimum cardinality of a disconnected dominating set of G. In this paper, we relate this parameter to other parameters of graph G and obtain some bounds also. dc ?
Other Latest Articles
- A study of matrix energy during peptide formation through chemical graphs
- Total complementary acyclic domination in graphs
- Domination number of distance k-complement graph
- On felicitous labelings of Pr,2m+1, P2m+1 r and Cn × Pm
- Order six block integrator for the solution of first-order ordinary differential equations
Last modified: 2013-08-24 12:27:31