Science and Education Publishing Turkish Journal of Analysis and Number Theory 2333-1232 5 1 2016 11 26 Domination Numbers of Graphs Containing Vertex-Disjoint Cycles in Graphs 1 4 EN Omprakash Sikhwal Devanshi Tutorial, Keshw Kunj, Mandsaur (M.P.), India Rekha Lahoti TJANT2017511 10.12691/tjant-5-1-1 2016 6 12 2016 9 18 2016 11 24 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 V-S 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.