| 图的邻域复形 |
| |
| 引用本文： | 谢力同,刘桂真. 图的邻域复形[J]. 山东大学学报(理学版), 1993, 0(1) |
| |
| 作者姓名： | 谢力同 刘桂真 |
| |
| 作者单位： | 山东大学数学研究所，山东大学数学研究所 |
| |
| 摘 要： | 一个图G的邻域复形是以G的顶点为顶点,以G的具有公共邻接顶点的顶点子集为单形的抽象复形.本文研究图的邻域复形的性质,复形的嵌入数以及邻域复形与图的关系等,并提出一些可供进一步研究的问题.
|
| 关 键 词： | 图 邻域复形 嵌入数 |
THE NEIGHBORHOOD COMPLEXES OF GRAPHS |
| |
| Xie Litong,Liu Guizhen Inst. of Math.,Shandong Univ.,Jinan. THE NEIGHBORHOOD COMPLEXES OF GRAPHS[J]. Journal of Shandong University, 1993, 0(1) |
| |
| Authors: | Xie Litong Liu Guizhen Inst. of Math. Shandong Univ. Jinan |
| |
| Abstract: | Let G be a graph and let V(G) be the vertex set of G. Define the neighborhood complex N(G) as the simplicial complex whose simplices are those subsets of V(G) which have a common neighbor. In this paper the properties of neighborhood complexes of graphs, the embedding number of any complex and the relations between neighborhood complexes and graphs are discussed. Furthermore, some open problems are presented. |
| |
| Keywords: | graph neighborhood complex embedding number |
| 本文献已被 CNKI 等数据库收录！ |
|
