We show that counting independent sets in several families of graphs can be done within the framework of generalized Zykov sums by using the transfer matrix method. Then we calculate the generating function of the number of independent sets for families of generalized Zykov sums. We include many interesting particular cases (Petersen graphs, generalized Móbius ladders, carbon nanotube graphs, among others).