Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of South China Normal University(Natural Science)》 1985-01
Add to Favorite Get Latest Update

THE THEOREM ON PARTITION OF CONNECTED GRAPH AND ITS APPLICATION IN GRAPHICAL ENUMERATION

Liu Bolian  
This paper attempts to prove the theorem on the partition of the connected graph. With the aid of this theorem,proving recursive formulas for enumeration of connected labeled graphs and labeled trees is simplified. Therefrom is derived the generating function for rooted labeled connected graphs whose roots have a given nurnbcr of block and recursive formulas for enumeration of 2-colored labeled connected graphe.
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved