Reliable broadcasting for interconnection networks can be achieved by constructing multiple independent spanning trees(ISTs) rooted at the same node. In this paper, we prove that there exists (n − 1)! sets of ISTs rooted at an arbitrary node for Qn and Mn based on circular dimensional-permutations of 0, 1, …, n − 1 and n ≥ 1. At the same time, we give an parallel algorithm, called BCIST, which is the further study of IST problem for Qn and Mn in literature. Furthermore, simulation experiments of ISTs based on JUNG framework and different sets of disjoint paths between node 1 and any node v ∈ V(0-M4)\{1} for 0-M4 are also presented.