新浪微博 Github
摘要: Labeled Tree: 每个节点都有标号的树,如图1(a)。Unlabeled Tree: 节点没有标号的树,如图1(b)。Cayley' Tree Formula: There are $n^{n-2}$ distinct labeled trees of order n.Prufer's Method:a labeled tree of order n is one-to-one correspondence with a sequence of length n-2.Prufer's Method 能够帮助我们更简单地证明 Cayley's Tree 阅读全文
posted @ 2013-05-31 13:00 xiazdong 阅读(963) 评论(0) 推荐(1) 编辑