Abstract: To study the independence bondage number and independence reinforcement number of some graphs such as paths, complete bipartite graphs, cycles and trees, Induction method and some theorems of independence number were used. Independence bondage number and independence reinforcement number of paths and cycles and independence bondage number of complete bipartite graphs have been obtained and an upper bound for independence reinforcement number of trees is given.