一类(a+1,3)型的距离正则图

设Γ是直径为d且型为(α 1,3)的距离正则图,其中α≥2.用l(c,a,b)表示交叉阵列l(Γ)中列(c,a,b)~t的个数,记r=r(Γ)=l(c_1,a_1,b_1),s=s(Γ)=l(c_(r 1),a(r 1),b_(r 1)).那末,若c_(r 1)=3且a_(r 1)=3a,则d=r s 1,c_d=4且Γ为正则拟2d边形.     

序为(3,3)的正则拟多边形

利用距离正则图的特征值方法,得到如下结论:设Γ是一个有序对为(3,3)正则拟多边形,如果d=r+1,则cd≠1,2,3.     

图的全控制数和匹配数的可比较性

设tγ(G)为G的全控制数.证明了:(1)对广义θ-图G,tγ(G)≤α(G) 1;(2)对任意k-正则无爪图G,k≥3,有tγ(G)≤α(G).这里α(G)表示G的匹配数.作为结果(2)的推论,对k-正则无爪图(k≥3),证明了Favaron猜想是成立的.即对最小度不小于3的简单图,有tγ(G)≤12 V(G).此外,举例说明了当图的最小度不超过2时,对一般图而言,匹配数与全控制数不可比较.     

完全图循环分解成2-正则图

Alspach提出如下猜想:"设n是奇数并且每个m1,m2,…,mh都是大于等于3而小于等于n的整数.若∑mi=n(n-1)/2,则Kn可以分解成圈Cm1,Cm2,…,Cmh."用记号C(mn11 mn22…mn88)表示由ni个mi长圈,i=1,2,…8组成的2-正则图.设Γ={G((2mi)ni…(2m8)n8)|i ∈[1,8]}.研究了循环(Kv,Γ)-分解的构造方法及其存在性问题,并且证明了Alspach猜想的一些特殊情况.     

度为奇数的正则图的上负全控制数

f:v(G)→{一1,0,1}称为图G的负全控制函数,如果对任意点V∈V,均有f[v]≥1,其中 f[v]= ∑,f(u).如果对每个点v∈V,不存在负全控制函数g:V(G)→{-l,0,1),g≠f,满u∈N(v)足g(v)≤f(v),则称f是-个极小负全控制函数.图的上负全控制数F-t(G)=max{w(f)|f,是G的极小负全控制函数},其中w(f)=∑/v∈V(G)f(v).本文研究正则图的上负全控制数,证明了:令G是-个v∈V(G)n阶r-正则图.若r为奇数,则Γt-(G)＜＝r2 1/r2 2r-1n.     

无爪3 -正则图的独立数

如果图G的一个集合X中任两个点不相邻, 则称 X 为独立集合. 如果 N[X]=V(G), 则称X是一个控制集合. i(G)(β(G))分别表示所有极大独立集合的最小(最大)基数. γ(G)(Γ(G))表示所有极小控制集合的最小(最大)基数. 在这篇论文中, 作者证明如下结论: (1) 如果 G ∈R 且G 是n阶3 -正则图, 则 γ(G)= i(G), β(G)=n/3. (2) 每个n阶连通无爪3 -正则图 G, 如果 G(G≠ K₄) 且不含诱导子图K₄-e, 则 β(G) =n/3.     

距离正则图的推广

本文研究了直径为d(Γ) ≥ 2的距离正则图Γ的补图.利用Γ的交叉数分别证明了当d=2时,Γ的补图式强正则;当d ≥ 3时,Γ的补图是广义强正则.将文献[2]中的距离正则图Grassmann图、对偶极图、Hamming图推广到它们的补图,从而得到广义强正则图.     

关于Von Neumann正则环的一个问题

设A是结合环,如果α∈αAα,(?)α∈A,则称A是Von Neumann正则环,以下简称正则环.环A的理想ι称为A的正则理想,如果ι作为环是正则环.结合环A的元素α叫做双正则元素,如果α在A中生成的主理想(α)有单位元.所有元都是双正则元的环叫做双正则环.如果环A的理想ι是双正则环,测称ι是A的双正则理想.我们知道,对任意结合环A,存在最大的正则理想(?)(A)和最大的双正则理想B(A).正则环全体之类(?)是Amitsur—Kurosh意义下的一个根环类,而且是一个遗传类.关于最大的双正则理想,Szasz在[1]的定理44.9中给出了如下结论:     

连通度与强正则图的2—可扩性

本文证明了所有具有偶顶点数的强正则图是1—可扩的,如果强正则图G具有偶顶点数和参数(v,k,α,β),并且G的圈边连通度至少为3k—3测G是2—可扩的.     

关于带重力项一维渗流方程解的自由边界的C^k正则性的一点注记

本文研究带重力项的一维渗流方程 u_t=(u~m)_(xx)+(u~n)_x,m>1,n>1Cauchy问题解的自由边界的正则性.正如我们所知,此退化方程解的显著特征是满足有限传播速度:当初值u_0(x)具有紧支集时,自由边界x=ζ_i(t),(i=1,2)是两条Lipschitz连续曲线.本文进一步研究指出:当n≥m对压力v=m/(m-1)u~(m-1)有ζ'_1(t)=-limv_x(x,t),t∈(0,∞),且对ζ_1(t)的任何移动部份Γ是C~1正则的;当n-1/m-1≥k,k为正整数,则微商(1≤2l+j≤k)在Γ的每一侧附近是有界的;特别当n-1/m-1=k,则任意阶微商(l≥0,j≥0)在Γ的每一侧附近有界,从而v在Γ的每一侧是C~∞的。 本文只考虑i=1的情形,至于i=2可类似地加以考虑。     

Subconstituents of unitary graphs over finite fields

The subconstituents of the isotropic unitary graphs over finite fields are shown to be quasi-strongly regular. In addition, the first subconstituent is shown to be co-edge regular and the second subconstituent is shown to be edge regular. The automorphism group of the second subconstituent is also determined.     

A class of amply regular graphs related to the subconstituents of a dual polar graph

The connected components of the induced graphs on each subconstituent of the dual polar graph of the odd dimensional orthogonal spaces over a finite field are shown to be amply regular. The connected components of the graphs on the second and third subconstituents are shown to be distance-regular by elementary methods.     

Subconstituents of orthogonal graphs of odd characteristic

In this paper, the subconstituents of the isotropic orthogonal graphs over finite fields of odd characteristic are studied. The first subconstituent is strongly regular, while the second subconstituent is edge-regular. The full automorphism groups of these two subconstituents have also been determined.     

模态系统与蕴涵系统

<正> 在本文中我们采用(?)ukasiewicz 符号,以(?)分別表示“非α或β”(实质蕴涵)“α或β”(析取)“α与β“(舍取)“C_(αβ)且C_(αβ)”(实质等价)“非α”(否定).此外,我们更引入下列符号“□α”——α是必然的,必然α;“◇α”——α是可能的,可能α;“Fαβ”表示口 C_(αβ),G_(αβ)”表示 KF_(αβ)F_(αβ)(注意,它与□E_(αβ)未必相同).但须注意,在最后一节内,F_(αβ)另有意义.我们采用公理模式而不采用合有命题变元的公理,因此在证明过程中可以用不到代入规则.     

Codiameters of 3-domination critical graphs with toughness more than one

A graph G is 3-domination-critical (3-critical, for short), if its domination number γ is 3 and the addition of any edge decreases γ by 1. In this paper, we show that every 3-critical graph with independence number 4 and minimum degree 3 is Hamilton-connected. Combining the result with those in [Y.J. Chen, F. Tian, B. Wei, Hamilton-connectivity of 3-domination critical graphs with α≤δ, Discrete Mathematics 271 (2003) 1-12; Y.J. Chen, F. Tian, Y.Q. Zhang, Hamilton-connectivity of 3-domination critical graphs with α=δ+2, European Journal of Combinatorics 23 (2002) 777-784; Y.J. Chen, T.C.E. Cheng, C.T. Ng, Hamilton-connectivity of 3-domination critical graphs with α=δ+1≥5, Discrete Mathematics 308 (2008) (in press)], we solve the following conjecture: a connected 3-critical graph G is Hamilton-connected if and only if τ(G)>1, where τ(G) is the toughness of G.     

The uniqueness of the strongly regular graph on 77 points

We show the uniqueness of the strongly regular graph with parameters ν = 77, k = 16, λ = O, μ = 4 embedding it in the Higman-Sims graph as a second subconstituent, and indicate the existence of a sporadic geometry.     

Lifting constructions of strongly regular Cayley graphs

We give two “lifting” constructions of strongly regular Cayley graphs. In the first construction we “lift” a cyclotomic strongly regular graph by using a subdifference set of the Singer difference sets. The second construction uses quadratic forms over finite fields and it is a common generalization of the construction of the affine polar graphs [7] and a construction of strongly regular Cayley graphs given in [15]. The two constructions are related in the following way: the second construction can be viewed as a recursive construction, and the strongly regular Cayley graphs obtained from the first construction can serve as starters for the second construction. We also obtain association schemes from the second construction.     

Construction of symplectic graphs by using 2-dimensional symplectic non-isotropic subspaces over finite fields

In most extant studies, symplectic graphs are defined by 1-dimensional subspaces and their orthogonality. In this paper, the symplectic graph is defined by 2-dimensional non-isotropic subspaces and their intersection. The symplectic graph is shown to be a 4-Deza graph. While the first subconstituent is shown to be a 4-Deza graph when $\nu ⩾3$ and a 3-Deza graph when $\nu =2$, the second subconstituent is not regular, and the third subconstituent is a 4-Deza graph except in the case $\nu =2$, when it is empty.     

具有面积测度的一些仿射联络空间

<正> 为了要把 K 展空间和具有 K 重面积测度的空间结合起来,笔者和谷超豪讨论过具有两种结构的一些空间,第一种结构是:空间具有 K 维面积测度,就是说:对于空间的任何 K 维可微分流形 V_K 的一部分给定了一个 K 重积分,作为这部分的“面积”;第     

A presentation for reduced extended affine weyl groups

In 1985 K. Saito [Sal] introduced the concept of an extended affine Weyl group (EAWG), the Weyl group of an extended affine root system (EARS). In [A2, Section 5J, we gave a presentation called “a presentation by conjugation” for the class of EAWGs of index zero, a subclass of EAWGs. In this paper we will give a presentation wh.ich we call a “generalized present.ation by conjugation” for the class of reduced EAWGs. If the extended affine Weyl group is of index zero this presentation reduces to “a presentation by conjugation”. Our main result states that when the nullity of the EARS is 2, these two presentations coincide that is, EAWGs of nullity 2 have “a presentation by conjugation”. In [ST] another presentation for EAWGs of nullity 2 is given.