The changes in indices of modified graphs Original Research Article

We obtain upper bounds for the indices of two types of modification of a connected graph G; one is obtained from G by adding edges between the vertices of an independent set such that it induces a clique, the other is obtained from G by adding a new vertex with prescribed set of neighbors.