搜索结果: 1-2 共查到“系统学 Our Neighborhood”相关记录2条 . 查询时间(0.062 秒)
Let G be a 2-connected simple graph of order n. In this paper we prove the following generalization of Ore's theorem: If G is a 2-connected graph such that |N(u) \cup N(v)|+|N(u) \cup N(w)| ≥ n for ev...
Let C be a 2-connected graph on n\geq 31 venices. G is called pancyclic if itcontains a cycle of length for every l such that 3\leq l \leq n. In this paper we shall prove that if |N(u)\cup N(v)| \geq...