关于标定不相交图并图的树的计数

On the number of trees of united graph of disjoint labeled graph

本文就不相交的标定图的并图G =(V ,E) ,讨论当顶点选自V ,而边不属于E时所能构成树的棵数 ,其中得到的一些结果为文[1 ] [2 ] 等的一些结论的推广 .

In this paper,the number of trees of united graph of disjoint labeled graph with vertices belonging to V and edges not belonging to E is discussed.And some results in [1][2] are generalized.