Share Your Research, Maximize Your Social Impacts
Domination number of distance k-complement graph
Journal: International Journal of Mathematics and Soft Computing (Vol.3, No. 2)Publication Date: 2013-05-28
Authors : M. Kalanithi V. Swaminathan A. Selvam;
Page : 1-4
Keywords : Domination number; distance k-domination number; distance k-complement graph.;
Source : Download
Find it from : Google Scholar
Abstract
In this paper the extremal graphs on the domination number of the distance $k$-complement graph $G_k^c$ of a graph $G$ are characterized and the relation between the domination number of $G_k^c$ and the distance $k$-domination number of $G$ are established.
Other Latest Articles
- 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
- New self similar solution behind exponential magneto radiative blast wave in a dusty gas
- A novel watershed image segmentation technique using graceful labeling
- Graceful and odd graceful labeling of some graphs
Last modified: 2013-08-24 12:24:02