Independent Spanning Trees on Recursive Circulant Graphs
碩士 === 國立臺灣科技大學 === 資訊管理系 === 91 === Two spanning trees of a given graph G = (V, E) are said to be independent if they are rooted at the same vertex, say r, and for each vertex v Î V\{r} the two paths from r to v, one path in each tree, are internally disjoint. A set of spanning trees of...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/94651256289912105016 |