Enumeration of a Special Kind of Labeled Connected Graphs
摘要
This paper is concerned with the enumeration of a special kind of labeled connected graphs of which the cutpoint-graphs are trees.A new method-treelization is introduced, by which the enumeration of this special kind of graphs can be solved. The enumerative formula with generating function is derived. The method of treelization is powerful in solving enumeration problems of graphs and deserves further research. For example, using the similar way, another special kind of labeled connected graphs of which the block-graphs are trees can be enumerated.
引用本文（GB/T 7714）
杨玲玲, 李松臣. Enumeration of a Special Kind of Labeled Connected Graphs[J]. 天津大学学报：英文版, 2004.
引文网络
本站仅收录题录与摘要供学习参考，全文版权归属出版方；如有侵权请联系我们删除。