摘要
本文应用 Edmonds 定理得到了某些有向图中以固定顶点为根的弧互不交的支撑树形图的极大个数.
By means of Edmonds theorem.We abtain the maximum numbers of are- disjoint arborescences rooted at a given vertex in some digraphs.
关键词
有向图
根
支撑树形图
分支
Root
Branch
Spanning branch
Spanning tree
Tournament
