具有性质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.     

一类(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边形.     

链状正则图的平均距离

本文构造了一类链状正则图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型距离正则图的特征,并计算了这类图的交叉数.     

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

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

E1οEd型距离正则图及 Q-多项式的性质

设Г是一个直径d ≥ 3的非二部距离正则图,其特征值θ0＞θ1＞…＞θ<,d.设θ1 ∈{θ1,θd),θd,是θ1在{θ1,θd}中的余.又设Г是具有性质E1οEd=|X|-1＞(qd-11dEd-1 qd1dEd)的E1○Ed型距离正则图,σ0,σ1,…,σd,ρ0,ρ1,…,ρd和β0,β1,…,βd分别是关于θ1',θd和θd-1'的余弦序列.利用上述余弦序列,给出了Г关于θ1或θd是 Q-多项式的充要条件.     

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

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

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

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

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

给出了     

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

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

Distance-regular graphs with girth 3 or 4: I

We study the structure of a distance-regular graph Γ with girth 3 or 4. First, we find some relationships among the intersection numbers of Γ when Γ contains a cycle {u₁, u₂, u₃, u₄} with ?(u₁, u₃) = ?(u₂, u₄) = 2. These relationships imply the diameter d, valency k, and intersection numbers a₁ and c_d of Γ are related by $\text{d ≤}\text{(k + c}{}_{\mathrm{d}}\text{)}\text{(a}{}_1\text{+ 2)}$. Next, we show subgraphs induced by vertex neighbourhoods in distance-regular graphs where cycles mentioned above do not exist are related to certain strongly regular graphs.     

Graphs are (1,Δ+1)-choosable

A graph $G$ is $(k,k^{\prime })$-choosable if the following holds: For any list assignment $L$ which assigns to each vertex $v$ a set $L\left(v\right)$ of $k$ real numbers, and assigns to each edge $e$ a set $L\left(e\right)$ of $k^{\prime }$ real numbers, there is a total weighting $?:V\left(G\right)\cup E\left(G\right)\to R$ such that $?\left(z\right)\in L\left(z\right)$ for $z\in V\cup E$, and ${\sum }_{e\in E\left(u\right)}?\left(e\right)+?\left(u\right)\ne {\sum }_{e\in E\left(v\right)}?\left(e\right)+?\left(v\right)$ for every edge $uv$. This paper proves that if $G$ is a connected graph of maximum degree $\Delta \ge 2$, then $G$ is $(1,\Delta +1)$-choosable.     

The exponential Diophantine equation x2 + (3n 2 + 1) y = (4n 2 + 1) z

Let n be a positive integer. In this paper, using the results on the existence of primitive divisors of Lucas numbers and some properties of quadratic and exponential diophantine equations, we prove that if n ≡ 3 (mod 6), then the equation x ² + (3n ² + 1) ^y = (4n ² + 1) ^z has only the positive integer solutions (x, y, z) = (n, 1, 1) and (8n ³ + 3n, 1, 3).     

On a Conjecture of Bannai and Ito: There are Finitely Many Distance-regular Graphs with Degree 5, 6 or 7

Bannai and Ito conjectured in a 1987 paper that there are finitely many distance-regular graphs with fixed degree that is greater than two. In a series of papers they showed that their conjecture held for distance-regular graphs with degrees 3 or 4. In this paper we prove that the Bannai–Ito conjecture holds for degrees 5–7.     

Distance-regular graphs and (α, β)-geometries

We study the relation between distance-regular graphs and (α, β)-geometries in two different ways. We give necessary and sufficient conditions for the neighbourhood geometry of a distance-regular graph to be an (α, β)-geometry, and describe some (classes of) examples. On the other hand, properties of certain regular two-graphs allow us to construct (0, α)-geometries on the corresponding Taylor graphs.     

Gruppen mit RelationenX 3=1, (XY)3=1

Ohne Zusammenfassung     

超椭圆曲线y~k=x(x+1)(x+3)(x+4)上的有理点

针对超椭圆曲线y~k=x(x+1)(x+3)(x+4)上是否存在有理点这一问题,运用了分类讨论的方法求解出当k≥3且k≠4时,该超椭圆曲线上的有理点只有(0,0);(-1,0);(-3,0);(-4,0).