| 有向图中几类支撑树数目的计算公式 |
| |
| 引用本文： | 翟晓燕. 有向图中几类支撑树数目的计算公式[J]. 运筹与管理, 2000, 9(1): 26-31 |
| |
| 作者姓名： | 翟晓燕 |
| |
| 作者单位： | 广州大学模糊系统与知识工程研究所，广东广州510091 |
| |
| 摘 要： | 将W.T.Tultte提出的计算有向图中以某点为根的支撑出树数目的公式推广到了更一般的情况，并给出了有向图中具有不同特点的支撑树数目的计算公式。
|
| 关 键 词： | 有向图 支撑树 支撑出树 支撑入树 Tultte公式 |
The Calculating Formulas on the Number of the Some kind Spanning Trees in Digraph |
| |
| ZHAI Xiao yan. The Calculating Formulas on the Number of the Some kind Spanning Trees in Digraph[J]. Operations Research and Management Science, 2000, 9(1): 26-31 |
| |
| Authors: | ZHAI Xiao yan |
| |
| Abstract: | In this paper, the formula for counting spanning outgoing tree with a root in digraph, which presented by W.T.Tultte, is extended into more general case, and some different formulas for connting different spanning trees in digraph are proposed. |
| |
| Keywords: | spanning tree spanning outgoing tree spanning incoming tree. |
| 本文献已被 CNKI 维普 等数据库收录！ |
