On adjacent-vertex-distinguishing total coloring of graphs

In this paper, we present a new concept of the adjacent-vertex-distinguishing total coloring of graphs (briefly, AVDTC of graphs) and, meanwhile, have obtained the adjacent-vertex-distinguishing total chromatic number of some graphs such as cycle, complete graph, complete bipartite graph, fan, wheel and tree.  

图的距离不大于β的任意两点可区别的边染色

本文提出了图的距离不大于β的任意两点可区别的边染色,即D(β)-点可区别的边染色(简记为D(β)-VDPEC)．并得到了一些特殊图类,如圈、完全图、完全二部图、扇、轮、树以及一些联图的D(β)-点可区别的边色数,文后提出了相关的猜想．  

拓扑遍历与拓扑双重遍历

令X为紧致度量空间,f:X→X为连续映射,U,V为X的任意非空开集,若{n>0|fn(U)∩V≠ )为正上密度集,则称f拓扑遍历.f拓扑双重遍历意味着f×f拓扑遍历.本文在[2]的基础上进一步讨论拓扑遍历与拓扑双重遍历映射的性质.  

s-半置换子群对群构造的影响

群G的一个子群H称为半置换的,若对G的任意子群K,只要(|H|,|K|)=1,就有HK=KH;H称为s-半置换的,若对G的任意Sylow p-子群P,只要(p,|H|)=1,就有HP=PH.本文研究极大子群和极小子群的某些子群的s-半置换性对群构造的影响,推广和改进了Asaad及王品超等人所得的结果.  

抽象半线性发展方程初值问题解的存在性

本文研究Banach空间E中具有非紧半群的半线性发展方程初值问题u′(t)+Au(t)=f(t,u(t)),t≥0;u(0)=x_0解的存在性,其中-A为E中等度连续C_0-半群的生成元,f:[0,∞)×E→E连续。在f满足较弱的非紧性测度条件下,获得了该问题饱和mild解的存在性。特别,当E为有序弱序列完备Banach空间时,我们获得了一个不需要非紧性测度条件的便于应用的存在性结果。  

拓扑遍历映射

本文研究紧致度量空间上拓扑遍历自映射的性质、判定及与混沌的关系．  

Lie Bialgebras of Generalized Virasoro-like Type

In this paper, Lie bialgebra structures on generalized Virasoro-like algebras are studied. It is proved that all such Lie bialgebras are triangular coboundary.  

基于比率的三种群捕食者-食饵扩散系统的周期解

本文研究一类基于比率的三种群捕食者-食饵扩散系统,利用重合度理论建立了这类系统正周期解的存在性结果。  

SPR technique and finite element correction

Summary This paper considers the finite element method for two-point boundary value problems using projection interpolation. Some correction results for the derivative and displacement are proved directly. Computational results demonstrate the theoretical findings. This work was supported by China NSF. Mathematics Subject Classification (2000):65N30The authors would like to thank the referees and Professor M. Krizk for the comments and suggestions for improving the presentation of this paper.  

A Note on Adjacent Strong Edge Coloring of K（n,m）

In this paper, we prove that the adjacent strong edge chromatic number of a graph K（n,m） is n ＋ 1, with n ≥ 2, m ≥ 1.