- 作者: 王駿發;吳美慧
- 作者服務機構: 國立成功大學電機研究所;國立成功大學應用數學研究所
- 中文摘要: 本篇論文探討有關函遍樹個數之最大化,吾人得到一些結果:第一、若G為p個點,q個邊的圖,且它含有最多之函遍樹數目,則G為一方塊(block)。第二、在p個點,p+l個邊的圖中,推得含有最多函遍樹數目之圖形及其公式。第三、利用Boesch所提出的"Path Property"可以較簡單的證明Shier所得出的主要定理並擴充之。論文編號:AE-086
- 英文摘要: This paper considers the problem of maximizing the number of spanning trees. Some new resultsare obtained: First, if G is the (p, q) graph which contains the maximum number of spanning trees then G is ablock. Second, the formula and the graph topology for the maximum number of spanning trees among theclass of (p, p+1) graphs is established. Third, by using the so called "path property"[3], the main theorem in[10] can be proved muchmore simply and will be extended.
- 中文關鍵字: spanning tree; path property; cycle diagonal graph
- 英文關鍵字: --