| 树图及其顶点数的计算 |
| |
| 引用本文： | 阿不力米提·伊明. 树图及其顶点数的计算[J]. 新疆师范大学学报(自然科学版), 2007, 26(2): 25-27,30 |
| |
| 作者姓名： | 阿不力米提·伊明 |
| |
| 作者单位： | 新疆师范大学,数理信息学院,新疆,乌鲁木齐,830054 |
| |
| 摘 要： | 文章从生成树之间的距离出发,定义了连通图的树图概念并证明了若干个简单性质,然后根据基本关联矩阵的性质,讨论了用行列式计算给定连通图的树图的顶点数。
|
| 关 键 词： | 生成树 距离 关联矩阵 度数 |
| 文章编号： | 1008-9659-（2007）-02-0025-03 |
| 修稿时间： | 2006-10-22 |
Tree Graph and the Calculation of its Vertices |
| |
| Abulimiti YIMING. Tree Graph and the Calculation of its Vertices[J]. Journal of Xinjiang Normal University(Natural Sciences Edition), 2007, 26(2): 25-27,30 |
| |
| Authors: | Abulimiti YIMING |
| |
| Affiliation: | School of Maths - physics and Information Scence , Xinjiang normal university, Urumqi Xinjiang 830054 |
| |
| Abstract: | Starting from the distance between spanning trees,this paper defines the conception of tree graph of the connecting graph, and clarifies its several simple characteristics.On this basis,it discusses,by using determinant,the calculation method of the number of tree graph vertices of the known connecting graph according to the nature of the basic incident matrix. |
| |
| Keywords: | Spanning trees distance incident matrix degree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
