搜索结果: 1-3 共查到“信息科学与系统科学 Our Neighborhood”相关记录3条 . 查询时间(0.062 秒)
THE NEIGHBORHOOD INTERSECTIONS OF ESSENTIAL SETS AND HAMILTONICITY OF GRAPHS
LTW-sequence essential sets T-vertex i
2007/8/7
n(Y) for each Y∈I^*_{k+1}(G), then G is Hamilton-connected. The existing results are generalized by these since I_{k+1}(G) is replaced by I^*_{k+1}(G). We introduce a new technique of T-insertion in t...
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...