• There is a recursive formula for the number of spanning trees in a graph.

    对于一个图的生成树的棵数,存在一个递推公式。

    youdao

  • The most vital nodes are those whose removal with their incident links most drastically decreases the number of spanning trees.

    从图中去掉节点以及相关联的链路后,所得到的图对应的生成树数目越少,则表明该组节点越重要。

    youdao

  • The number of spanning trees is an important invariant of a graph, it is also an important measure of the reliability of a network.

    图的支撑树数是图的重要的不变量,也是网络可靠性的重要量度。

    youdao

  • This method ranks the node importance over all nodes in a network. The relative importance of two nodes in a graph is compared in terms of the number of spanning trees.

    该方法可以评价全网范围内的节点重要性,通过比较生成树的数目,可以判断通信网中任意两个节点的相对重要性。

    youdao

  • This method ranks the node importance over all nodes in a network. The relative importance of two nodes in a graph is compared in terms of the number of spanning trees.

    该方法可以评价全网范围内的节点重要性,通过比较生成树的数目,可以判断通信网中任意两个节点的相对重要性。

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定