立方图的邻域同调分类

Neighborhood Homology Classification for Cubic Graphs

立方图是指每个顶点的次数都等于３的有限简单连通图，本文讨论了立方图的邻域复形的性质，证明了两个立方图是邻域同调的充要条件为它们的二分性相同并且Ｄ值相等。

A cubic graph is a finite simple connected graph each of whose verter-degree is equalto 3.We discussed the properties of neighborhood complexes of cubic graphs,proved that twocubic graphs are neighborhood homologous iff they have the same bipartite property and Dnumber.