Using it the directed tree polynomial of a directed graph G can be found conveniently and efficiently.
应用它可以方便且有效地求出一个有向图G的有向树多项式。
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的有向树。
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的有向树。
应用推荐