Non-wandering points and the depth for graph maps

作     者：Jie-hua MAI~1 Tai-xiang SUN~(2+) ~1 Institute of Mathematics,Shantou University,Shantou 515063,China ~2 College of Mathematics and Information Sciences,Guangxi University,Nanning 530004,China 

作者机构：Institute of Mathematics Shantou University Shantou China College of Mathematics and Information Sciences Guangxi University Nanning China 

出 版 物：《Science China Mathematics》 (中国科学：数学（英文版）)

年 卷 期：2007年第50卷第12期

页      面：1818-1824页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：This work was supported by the Special Foundation of National Prior Basis Researches of China (Grant No.G1999075108) the National Natural Science Foundation of China (Grant No.10461001) the Natural Science Foundation of Guangxi (Grant Nos.0728002,0640205) 

主　　题：graph map, non-wandering point, the depth of a graph map 

摘      要：Let G be a graph and f:G→G be *** by R(f) andΩ(f) the set of recurrent points and the set of non-wandering points of f ***Ω_0(f) = G andΩ_n(f)=Ω(f|_(Ω_(n-1)(f))) for all n∈*** minimal m∈NU {∞} such thatΩ_m(f)=Ω_(m+1)(f) is called the depth of *** this paper,we show thatΩ_2 (f)=(?) and the depth of f is at most ***,we obtain some properties of non-wandering points of f.