1) rooted directed tree
根有向树
1.
Gives an algorithm to find effective paths by using the rooted directed tree.
利用根有向树给出一个求有效路径的算法，从而得到一个计算多级互联网络可靠度的简捷方法。
2) directed rooted tree
有向根树
1.
The Rrotation graph of a hexagonal system is a directed rooted tree.
六角系统的R-旋转图是1棵有向根树,但冠状系统的R-旋转图是一个有向森林,其底图不一定连通。
2.
A directed rooted tree refers to a directed tree which has one vertex with out-degree 0 and all the other vertices with out-degree 1.
有向根树就是只有一个顶点的出度为0,其余顶点的出度均为1的有向树。
3.
defined the R-conception of the rotation, and with which they established a hierarchical structure on the set of perfect matchings of a cata-hexagonal system, which could be represented by a directed rooted tree, and was called the R-rotation graph.
1981年Ohkami等提出了R-旋转变换的概念,并由此变换建立了cata型六角系统的完美匹配集上的一种层次组织结构,它可用一个有向根树来表示,称它为该六角系统的R-旋转图。
3) multiple directed rooted trees
多重有向根树
1.
define a multiplication operation between multiple directed rooted trees (denoted by ) and points out that the multiplication operation of finite directed rooted trees is also a directed rooted tree.
在此把这种运算推广到多重有向根树上,证明了这种运算对多重有向根树的封闭性,并证明了有限个多重有向根树经这种运算后为一棵有向根树当且仅当每个多重有向根树为一棵有向根树。
4) rooted tree
有根树
1.
The process to generate MIS is described by some rooted trees.
完整地研究了寻找一个图的全部极大独立集所需要的理论、寻找范围、计算公式和枚举方法，采用有根树描述，以邻接矩阵中任意一行所对应的顶点为根，再以该行中各个非零元素所对应的那些顶点为根，按照文中所述方法生成有根树，这些有根树就描述出图的全部极大独立集，本方法已用计算机程序实现。
5) Rooted trees
有根树
1.
In this paper, we find a relation between the isomorphism classes of rooted trees and all the inequivalent simple root systems of imprimitive complex reflection groups G(m, l,n).
时俭益教授引进了复反射群的单根系等价性与表出同余性的概念，并给出了本原复反射群G_(12)、G_(24)、G_(25)、G_(26)的所有不等价单根系及其所对应的所有不同余表出，见[12]，本文通过讨论非本原复反射群G(m，1，n)的生成元集的结构，得出了本原复反射群G(m，1，n)的单根系的等价类和n个顶点的有根树的同构类之间的关系，并给出非本原复反射群G(m，1，n)(当n=3，4，5时)的所有不等价的单根系及它们对应的所有不同余的表出。
6) identity rooted tree
幺有根树
补充资料：善根回向
【善根回向】
谓菩萨以种种修行善根，皆悉回向无上佛果菩提，普及法界众生，故云善根回向。（梵语菩提，华言道。）
谓菩萨以种种修行善根，皆悉回向无上佛果菩提，普及法界众生，故云善根回向。（梵语菩提，华言道。）
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条