@article{tjant2017511,
author={{Sikhwal, Omprakash and Lahoti, Rekha},
title={Domination Numbers of Graphs Containing Vertex-Disjoint Cycles in Graphs},
journal={Turkish Journal of Analysis and Number Theory},
volume={5},
number={1},
pages={1--4},
year={2017},
url={http://pubs.sciepub.com/tjant/5/1/1},
issn={2333-1232},
abstract={Domination in graphs has been an extensively researched branch of graph theory. In a graph, a domination set is a subset S of the vertices such that every vertices of <i>V</i>-<i>S</i> is adjacent to a vertex of S. The main object of this article is to study the domination numbers of graph containing vertex disjoint cycles with some identities of domination set and independent set. Further, we present some identities related to domination number, upper domination number, Independence number and independent domination number of graphs containing vertex-disjoint cycles.},
doi={10.12691/tjant-5-1-1}
publisher={Science and Education Publishing}
}