搜索结果: 1-1 共查到“理学 Neighborhood union”相关记录1条 . 查询时间(0.066 秒)
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...