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...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.展开更多
文摘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.
