搜索结果: 1-1 共查到“信息科学与系统科学 Neighborhood unions”相关记录1条 . 查询时间(0.046 秒)
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...