| q-树的重构性 |
| |
| 引用本文： | 韩伯棠.q-树的重构性[J].北京理工大学学报(英文版),1997,6(1):1-8. |
| |
| 作者姓名： | 韩伯棠 |
| |
| 作者单位： | 北京理工大学管理学院 北京 100081 |
| |
| 摘 要： | q 是一个正整数,所谓 q-树的图是递归定义的:最小的 q-树是完全图 Kq,一个 n+1阶的 q-树是通过在 n 阶 q-树上加上一个新点并连接这点与 n 阶 q-树中任意 q 个互相邻接的点而获得,其中 n≥q.1-树我们通常称为树.在本文中,证明了对任意正整数 q,q-树是可重构的.
|
| 关 键 词： | 树(数学) 重构(数学) 多项式 色多项式 |
The Reconstruction of q-Trees |
| |
| Han Botang.The Reconstruction of q-Trees[J].Journal of Beijing Institute of Technology,1997,6(1):1-8. |
| |
| Authors: | Han Botang |
| |
| Affiliation: | School of Business Management,Beijing Institute of Technology,Beijing 100081 |
| |
| Abstract: | Let q be a positive integer.The graphs,called the q-trees are defined by recursion:the smallest q-tree is the complete graph Kq with q vertices,and a q-tree with n+1 vertices where n≥q is obtained by adding a new vertex adjacent to each of q arbitrarily selected but mutually adjacent vertices of q-tree with n vertices.Obviously,1-trees are the graphs which are generally called trees.In this paper,it is proved that for any positive integer q,q-tree is reconstructible. |
| |
| Keywords: | , , , |
|
| 点击此处可从《北京理工大学学报(英文版)》浏览原始摘要信息 |
|
点击此处可从《北京理工大学学报(英文版)》下载全文 |
|
