The problem of counting the number of spanning trees of a network built by a replacement procedure that yields a self-similar structure is considered. This problem has been receiving growing attention in the specialized literature in the recent years. One of the important measures of the global reliability of a network is the number of spanning trees. In this paper, we present a correction of the two main theorems claimed by Ma and Yao [7] concerning the number and the entropy of spanning trees of a class of self-similar fractal models with proofs of the new results. Also, the numerical values of the number of spanning trees are obtained and compared with the values of the formula in Theorem 3.1 of [7].

考虑了计算由产生自相似结构的替换过程构建的网络的生成树数量的问题。近年来，该问题已在专业文献中受到越来越多的关注。网络全局可靠性的重要指标之一是生成树的数量。在本文中，我们提出了对Ma和Yao [7]声称的关于一类自相似分形模型的生成树的数量和熵的两个主要定理的修正，并证明了新的结果。同样，获得生成树数量的数值，并将其与[7]定理3.1中的公式的值进行比较。