点传递图有向连通度的下界

本文研究点传递有向图与定向留连通度的下界，对达到此下界的Ｃｈｙｌｅｙ有向图与定向图进行了刻划。     

PROJECTIVELY FLAT FINSLER METRICS WITH ALMOST ISOTROPIC S-CURVATURE

This article characterizes projectively flat Finsler metrics with almost isotropic S-curvature.     

对全微分方程的不定积分解法及证明的讨论

文[1]给出的全微分方程的一种求解方法，需要商榷。     

A CHARACTERIZATION OF EMBEDDABILITY OF GRAPHS ON SURFACES

In this article the Cn-graphs are introduced, by which a characterization of the embeddability of a graph on either an orientable surface or a non-orientable surface is provided.     

ON THE CONVERGENCE DOMAIN OF THEMATRIX MULTISPLITTING RELAXATION METHODS FOR LINEAR SYSTEMS

The convergence of the parallel matrix multisplitting relaxation methods presented by Wang (Linear Algebra and Its Applications 154/156 (1991) 473-486) is further investigated.The investigations show that these relaxation methods really have considerably larger convergence domains.     

LOCAL CHARACTERISTIC OF HOLOMORPHIC AUTOMORPHISM ON CLASSICAL DOMAIMS

§1.Ｉｎｔｒｏｄｕｃｔｉｏｎ　　ＬｅｔＭｂｅａｃｏｍｐｌｅｘｍａｎｉｆｏｌｄ.Ｆｏｒａｎｙｐ∈ＭａｎｄａｎｙＸ∈Ｔ1,0ｐ(Ｍ),ｔｈｅＫｏｂａｙａｓｈｉｉｎｆｉｎｉｔｅｓｉｍａｌｐｓｅｕｄｏｍｅｔｒｉｃ[1]ｏｆＸｉｓＦ(Ｘ):=ｉｎｆ｜ａ｜∈Ｃ,ｆ:ＤＭｓ.ｔ.ｆ(0)=ｐａｎｄｆ(ａｚ)=Ｘ,ｗｈｅｒｅＤｉｓｔｈｅｕｎｉｔｄｉｓｋａｎｄｆ∈Ｈｏｌ(Ｄ,Ｍ)ｉｓｔｈｅｈｏｌｏｍｏｒｐｈｉｃｍａｐｆｒｏｍＤｔｏＭ,ａｎｄｔｈｅＣａｒａｔｈｅｏｄｏｒｙｉｎｆｉｎｉｔｅｓｉｍａｌｐｅｕｓｄｏｍｅｔｒｉｃｏｆＸｉｓＥ(Ｘ):=ｓｕｐ…     

平面可弦图的子式障碍

证明了平面可弦图的子式障碍恰由Ｋ５，Ｋ３，３，Ｋ２，２，２和Ｋ２×Ｃ５这四个图构成     

关于L~2全纯(p,q)型的延拓

本文推广了T．Ohsawa关于L~2全纯函数的延拓理论，证明了对一般的L~2全纯（p，q）型的延拓定理．     

信赖域子问题使用重新开始策略的共轭梯度法

给出了用共轭梯度法解信赖域子问题的重新开始策略，并证明了方法的收敛性，数值结果表明该策略可以大大提高算法的收敛速度．