Abstract: On the basis of studying the enumeration problems for unlabeled graphs, the definition of subdivisible graphs is introduced. Using combinatorial methods, unified formulas dealing with the enumeration problems for subdivisible graphs are obtained.Applying these formulas, some new counting formulas and relations for some classes of subdivisible graphs are deduced.