Since the number of spanning trees in iterated line graphs are closed related with their original graphs, the numbers of spanning trees in iterated line graphs of above two special graphs can be thus obtained.
由于叠线图的支撑树数目与原图的支撑树数目有密切关系，所以这两类图的叠线图的支撑树数目也相应可以得到。
参考来源 - 无向循环图与广义de Bruijn有向图的支撑树与欧拉环游的计数·2,447,543篇论文数据，部分数据来源于NoteExpress
应用推荐