We introduce a new family of simple graphs, so called, growing graphs. investigate ways to modify given graph G combinatorially obtain graph. One may infinitely many graphs from single show that obtained any is Cohen–Macaulay and every chordal also prove under certain conditions, if only its clique complex grafted give several equivalent conditions in this case. Our work inspired by generalizes...