| 关于树的几个结果 |
| |
| 引用本文： | 高浩森.关于树的几个结果[J].甘肃高师学报,2011,16(2):17-18. |
| |
| 作者姓名： | 高浩森 |
| |
| 作者单位： | 东北大学理学院数学与应用数学系,辽宁沈阳,110004 |
| |
| 摘 要： | 树在图论研究以及复杂网络研究中常常用到.记号nd(G)表示图G中顶点度数为d的顶点的数目.本文利用树T的1度顶点个数可以由公式n1(T)=2+△(G)+D(G)n+1.对平面图G,它的面数(G)满足2(G)=4+d3Σ(d-2)n(dG).
|
| 关 键 词： | 树 叶子 独立集 路 直径 |
Several Results on Trees |
| |
| GAO Hao-sen.Several Results on Trees[J].Journal of Gansu Normal College,2011,16(2):17-18. |
| |
| Authors: | GAO Hao-sen |
| |
| Institution: | GAO Hao-sen(Department of Mathematics,College of Sciences,Northeastern University,Shenyang Liaoning 110004) |
| |
| Abstract: | As known,trees play an important role in research of graph theory and complex networks.Let nd（G） denote the number of vertices of degree d in a graph G.By means of the formula n1（T）=2＋（d-2）nd（T） for computing the number of vertices of degree one,it proves that △（G）＋D（G）≤n＋1 for any connected graph G on n vertices,and moreover a planar graph G has its number of faces as 2 φ（G）=4＋（d-2）nd（G）. |
| |
| Keywords: | Tree leaves independent set path diameter |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
