By means of Graph G labeling techniques, matrix and determinant computations, the complement-spanning-tree matrix theorem and inequalities computing etc., studies the number of spanning trees of the general situation of the path-based multi-complete related graphs when m=2, 3, 4, 5, and a1, a2, …, am are arbitrary numbers, and gets relative counting formula.