Independent Spanning Trees on Some Interconnection Networks
博士 === 國立臺灣科技大學 === 資訊管理系 === 95 === The vertex set and the edge set of a graph G are denoted by V (G) and E(G), respectively.Two paths P and Q connecting a vertex x to a vertex y are said to be internally disjoint, denoted by P||Q. A tree T is called a spanning tree of a graph G if V (T) = V (G). F...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/97253205773167631658 |