In chapter 2, we mainly inverstigate the number of spanning trees of composition of graphs and obtain some new results.
论文第二章主要研究了合成图的生成树计数问题,得到了一些新的结果。
参考来源 - 若干图的生成树数目和网络可靠性比较The most vital nodes are those whose removal with their incident links most drastically decreases the number of spanning trees.
从图中去掉节点以及相关联的链路后，所得到的图对应的生成树数目越少，则表明该组节点越重要。
参考来源 - 期刊学术社区·2,447,543篇论文数据，部分数据来源于NoteExpress
There is a recursive formula for the number of spanning trees in a graph.
对于一个图的生成树的棵数，存在一个递推公式。
The relative importance of two groups of nodes in the graph can be compared with respect to the number of spanning trees.
通过比较生成树的数目，可以判断图中任意数目的两组节点的相对重要性。
The most vital nodes are those whose removal with their incident links most drastically decreases the number of spanning trees.
从图中去掉节点以及相关联的链路后，所得到的图对应的生成树数目越少，则表明该组节点越重要。
应用推荐