摘要
本文证明了两个连通的无C4图是邻域同调的充要条件为它们的二分性相同，并且圈秩相等．
A graph which does not contain a four-cycle is called the C4-free graph.Two graphs are called neighborhood homologous if their neighborhood homology groups areisomorphic. This paper proves that two connected C4-free graphs are neighborhood homologousif and only if they have identical bipartite characters and equal cyclomatic numbers.
出处
《系统科学与数学》
CSCD
北大核心
1998年第1期101-103,共3页
Journal of Systems Science and Mathematical Sciences
关键词
领域同调
二分性
图
无四圈图
拓扑性质
A C4-free graph, neighborhood homology, identical bipartite character,cyclomatic number.
