中文摘要：

讨论了S_m∨F_n的邻点可区别Ⅰ-全染色,利用构造函数法,构造了一个从点边集V（G）∪E（G）到色集合{1,2,…,k}的函数,给出了S_m∨F_n的一种邻点可区别Ⅰ-全染色方案,得到了其邻点可区别Ⅰ-全色数.并在此种染色方法的基础上,通过适当调整S_m∨F_n的边及其染色,得到了S_m∨S_n,S_m∨W_n,F_m∨F_n的邻点可区别I-全色数,且满足猜想：χiat（G）≤Δ（G）＋2.

英文摘要：

This paper is about the adjacent vertex-distinguishing Ⅰ-total chromatic number of join graphs of S_m∨F_n.Applying the method of constructing function,this paper forms a function from the vertices and edges set V（G）∪E（G）to the color set{1,2,…,k},a new coloring method is given according to the feature of S_m∨F_n,and the adjacent vertex-distinguishingⅠ-total chromatic number of them are obtained.On the basis of this new coloring method,we adjust some edges of S_m ∨F_n and colored them,then obtained the adjacent vertex-distinguishing I-total chromatic number of S_m∨S_n,S_m∨W_n,Fm∨Fn which meet the conjecture：χiat（G）≤Δ（G）＋2.