Local bases of primitive non-powerful signed digraphs

In 1994, Z. Li, F. Hall and C. Eschenbach extended the concept of the index of convergence from nonnegative matrices to powerful sign pattern matrices. Recently, Jiayu Shao and Lihua You studied the bases of non-powerful irreducible sign pattern matrices. In this paper, the local bases, which are generalizations of the base, of primitive non-powerful signed digraphs are introduced, and sharp bounds for local bases of primitive non-powerful signed digraphs are obtained. Furthermore, extremal digraphs are described.  

半质环的一个交换性条件

定理 设R是半质环,则R是交换环的充分必要条件是: 对任意x,y∈R,存在整数n=n(x)>1,s=s(x)>1及t=t(x)>1(或者n=n(y)>1,s=s(y)>1及t=t(y)>1)使得 (xy)ⁿ-x³y^t∈Z(R). 其中Z(R)是R的中心。  

Path Decomposition of Graphs with Given Path Length

A path decomposition of a graph G is a list of paths such that each edge appears in exactly onepath in the list.G is said to admit a {P_l}-decomposition if G can be decomposed into some copies of P_l,whereP_l is a path of length l-1.Similarly,G is said to admit a {P_l,P_k}=decomposition if G can be decomposed intosome copies of P_l or P_k.An k-cycle,denoted by C_k,is a cycle with k vertices.An odd tree is a tree of which allvertices have odd degree.In this paper,it is shown that a connected graph G admits a {P_3,P_4}-decompositionif and only if G is neither a 3-cycle nor an odd tree.This result includes the related result of Yan,Xu andMutu.Moreover,two polynomial algorithms are given to find {P_3}-decomposition and {P_3,P_4}-decompositionof graphs,respectively.Hence,{P_3}-decomposition problem and {P_3,P_4}-decomposition problem of graphs aresolved completely.  

改进的优劣系数法及其区间数推广

首先,通过指标的优集合,相持集合和劣集合的定义,改进了优劣系数法中的一致性矩阵和不一致性矩阵的定义,定义使得一致性矩阵和不一致性矩阵具有很好的优良性质,进而使得优劣系数法更加简洁,实用.其次,利用区间数的可能度的性质和相离度的概念将优劣系数法推广到区间数决策问题中来.最后给出了两个算例.  

GEOMETRY OF EXPONENTIAL TYPE REGRESSION MODELS AND ITS ASYMPTOTIC INFERENCE

In this paper,exponential type regression modeis are considered from geometric point of view.The stochastic expansions relsting to the estimate are derived and are used to study several asymptotic inference problems.The biases and the covariances relating to the estimate may be calculated based on the expansions.The information loss of the estimate and a limit theorem connected with the observed and expected Fisher informations are obtained in terms of the curvatures.  

An extremal problem on non-full colorable graphs

For a given graph G of order n, a k-L(2,1)-labelling is defined as a function f:V(G)→{0,1,2,…k} such that |f(u)-f(v)|?2 when d_G(u,v)=1 and |f(u)-f(v)|?1 when d_G(u,v)=2. The L(2,1)-labelling number of G, denoted by λ(G), is the smallest number k such that G has a k-L(2,1)-labelling. The hole index ρ(G) of G is the minimum number of integers not used in a λ(G)-L(2,1)-labelling of G. We say G is full-colorable if ρ(G)=0; otherwise, it will be called non-full colorable. In this paper, we consider the graphs with λ(G)=2m and ρ(G)=m, where m is a positive integer. Our main work generalized a result by Fishburn and Roberts [No-hole L(2,1)-colorings, Discrete Appl. Math. 130 (2003) 513-519].  

图的L(3,2,1)-标号

无向图G的L(3,2,1)-标号是指从顶点集V(G)到非负整数集Z*的一个映射,满足:对i=1,2,3,只要dG(x,y)=i,则f(x)-f(y)|≥4-i.若一个L(3,2,1)-标号中的所有像元素都不超过整数k,则称之为k-L(3,2,1)-标号.图G的L(3,2,1)-标号数,记作3λ(G),是使得图G存在k-L(3,2,1)-标号的最小整数k.文中给出了路、圈、树等特殊图的L(3,2,1)-标号数,并给出了一般图的L(3,2,1)-标号数的一个上界.  

A TWO-STEP EXPLICIT METHOD FOR A CLASS OF LINEAR PERIODIC INITIAL VALUE PROBLEMS

This paper presents a two-step explicit method of order four for solving a class of linear periodic initial value problems. At each computational step, only two right function evaluations and one derivative evaluation are employed. Basing on a special vector operation, the method can be extended to the vector-applicable in multidimensional space.  

Von Neumann正则环的几点注记

本文利用理想化子的概念定义了duo环的一个推广,称为MD环,并且研究了MD环的一些性质.特别地.我们证明了:如果R是MD环,且每一个奇异单左R-模是p-内射的,那么R是指数有界的von Ncumann正则环,因此,R.Yue chi ming提出的如下公开问题得到了肯定的回答:GLD左Γ-环是否为Von ncumann正则的?  

Notes on Automorphisms of Prime Rings

Let Rbe a prime ring, L a noncentral Lie ideal and σ a nontrivial automorphism of Rsuch that usσ(u)ut = 0 for all u ∈ L, where s, t are fixed non-negative integers. If either charR>s+t or charR=0, then...