| 关于标定不相交图并图的树的计数 |
| |
| 引用本文： | 丁双双,程元玲. 关于标定不相交图并图的树的计数[J]. 淄博学院学报(自然科学与工程版), 2000, 2(1): 20-21 |
| |
| 作者姓名： | 丁双双 程元玲 |
| |
| 作者单位： | 山东工程学院!山东淄博255012(丁双双),淄博卫校!山东淄博255000(程元玲) |
| |
| 摘 要： | 本文就不相交的标定图的并图G =(V ,E) ,讨论当顶点选自V ,而边不属于E时所能构成树的棵数 ,其中得到的一些结果为文[1 ] [2 ] 等的一些结论的推广 .
|
| 关 键 词： | 树 并图 不相交图 计数 标定图 图论 |
On the number of trees of united graph of disjoint labeled graph |
| |
| WTBZ]DING Shuang shuang ,CHENG Yuan ling. On the number of trees of united graph of disjoint labeled graph[J]. Journal of Zibo University(Natural Sciences and Engineering), 2000, 2(1): 20-21 |
| |
| Authors: | WTBZ]DING Shuang shuang CHENG Yuan ling |
| |
| Affiliation: | WT5BZ]DING Shuang shuang 1,CHENG Yuan ling 2 |
| |
| Abstract: | 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. |
| |
| Keywords: | graph tree united graph |
| 本文献已被 CNKI 维普 等数据库收录！ |
