具有性质cr+1=3,ar+1=3a+1或 4a的(a+1,3)型距离正则图

设г是直径为d且型为(a 1,3)的距离正则图,其中a≥2.用l(c,a,b)表示交叉阵列ι(г)中列(c,a,6)t的个数,记r=r(г)=l(c1,a1,b1),8=8(г)=l(Cr 1,ar 1,br 1)及t=t(г)=l(cr s 1,ar s 1,br s 1).那末,若Cr 1=3,ar 1=4a或3a 1,则d=r t 2.     

具有性质cr 1=3,ar 1=3a 1或 4a的(a 1,3)型距离正则图

设г是直径为d且型为(a 1,3)的距离正则图,其中a≥2.用l(c,a,b)表示交叉阵列ι(г)中列(c,a,6)t的个数,记r=r(г)=l(c1,a1,b1),8=8(г)=l(Cr 1,ar 1,br 1)及t=t(г)=l(cr s 1,ar s 1,br s 1).那末,若Cr 1=3,ar 1=4a或3a 1,则d=r t 2.     

距离正则图的推广

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

关于加权距离正则图和立方图

令G=(V,E)是简单的连通k-正则图;w_1相似文献   

链状正则图的平均距离

本文构造了一类链状正则图G_k∶δ,求出了它们的平均距离D(G_k.δ),并得到关系式上式等号成立当且仅当δ=4f且k=0.这个估计式指出了施容华猜想[1]D(G)≤n/(δ 1)不成立. 文中进一步证明了这一类链状正则图有最大的直径,所以可以作出猜想: 若G是n阶连通图,则D(G)<(n 1)/(δ 1),其中δ是图G的最小度。     

E1(о)Ed型距离正则图的关于余弦序列的不等式

给出了E1(о)Ed型距离正则图的关于余弦序列的不等式.     

型距离正则图的关于余弦序列的不等式

给出了     

具有广义可行性余弦序列的E1(。)Ed型距离正则图

给出了具有广义可行性余弦序列的E1(?)Ed型距离正则图的特征,并计算了这类图的交叉数.     

E_1 ~oE_d型距离正则图的关于余弦序列的不等式

给出了E1 Ed型距离正则图的关于余弦序列的不等式.     

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

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

The Regular Near Polygons of Order (s, 2)

In this note we classify the regular near polygons of order (s, 2).     

A Distance-Regular Graph with Intersection Array (5, 4, 3, 3; 1, 1, 1, 2) Does Not Exist

We prove that a distance-regular graph with intersection array (5, 4, 3, 3; 1, 1, 1, 2) does not exist. The proof is purely combinatorial and computer-free.     

A Higman-Haemers Inequality for Thick Regular Near Polygons

In this note we will generalize the Higman-Haemers inequalities for generalized polygons to thick regular near polygons.     

Distance-Regular (0,α)-Reguli

We introduce distance-regular (0,α)-reguli and show that they give rise to (0,α)-geometries with a distance-regular point graph. This generalises the SPG-reguli of Thas [14] and the strongly regular (α,β)-reguli of Hamilton and Mathon [9], which yield semipartial geometries and strongly regular (α,β)-geometries, respectively. We describe two infinite classes of examples, one of which is a generalisation of the well-known semipartial geometry T_n^*(B) arising from a Baer subspace PG(n, q) in PG(n, q²). Research Fellow supported by the Flemish Institute for the Promotion of Scientific and Technological Research in Industry (IWT), grant no. IWT/SB/13367/Tonesi Research assistant of the Fund for Scientific Research Flanders (FWO-Vlaanderen).     

The valuations of the near hexagons related to the Witt designs S(5,6,12) and S(5,8,24)

Valuations of dense near polygons were introduced in 16 . In the present paper, we classify all valuations of the near hexagons ??₁ and ??₂, which are related to the respective Witt designs S(5,6,12) and S(5,8,24). Using these classifications, we prove that if a dense near polygon S contains a hex H isomorphic to ??₁ or ??₂, then H is classical in S. We will use this result to determine all dense near octagons that contain a hex isomorphic to ??₁ or ??₂. As a by‐product, we obtain a purely geometrical proof for the nonexistence of regular near 2d‐gons, d ≥ 4, whose parameters s, t, t_i (0 ≤ i ≤ d) satisfy (s, t₂, t₃) = (2, 1, 11) or (2, 2, 14). The nonexistence of these regular near polygons can also be shown with the aid of eigenvalue techniques. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 214–228, 2006     

关于5-正则图的强协调性

构造了若干个 5 -正则图的强协调值 ,从而证明它们都是强协调的     

Regular induced subgraphs of a random Graph

An old problem of Erd?s, Fajtlowicz, and Staton asks for the order of a largest induced regular subgraph that can be found in every graph on vertices. Motivated by this problem, we consider the order of such a subgraph in a typical graph on vertices, i.e., in a binomial random graph . We prove that with high probability a largest induced regular subgraph of has about vertices. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 38, 235–250, 2011