屏幕图形的压缩存贮与释放及其在机构动态模拟中的应用

由于常规的动态模拟方法的模拟效果受到图形复杂性的严格限制，通常只用于简单图形的动态模拟．本文介绍的屏幕图形的压缩存贮与释放显示方式与图形的复杂程度无关或关系甚微，对复杂图形也能产生极为逼真的动画效果．文章论述了屏幕图形的压缩存贮与释放的实现原理及对于不同图形适配器如ＣＧＡ、ＥＧＡ／ＶＧＡ的程序设计方法，并用Ｃ语言编制了相应的子程序．通过对增程式游梁抽油机主体机构的动态模拟，介绍了其应用及程序编制的技巧．本方法不仅在机构ＣＡＤ、ＣＡＩ及其他动画技术中能发挥重要作用，而且能在图形系统的开发中得到很好的应用，其程序具有很好的移值性．     

The connectivity of the block-intersection graphs of designs

It is shown that the vertex connectivity of the block-intersection graph of a balanced incomplete block design,BIBD (v, k, 1), is equal to its minimum degree. A similar statement is proved for the edge connectivity of the block-intersection graph of a pairwise balanced design,PBD (v, K, 1). A partial result on the vertex connectivity of these graphs is also given. Minimal vertex and edge cuts for the corresponding graphs are characterized.Research supported in part by a B.C. Science Council G.R.E.A.T. Scholarship.Research supported in part by an NSERC Postdoctoral Fellowship.     

舵轮图的协调性

文中给出了舵轮图helms的强协调标号。从而解决了该图类的协调性和强协调性。     

The connectivity of a graph on uniform points on [0,1]

A random graph G_n(x) is constructed on independent random points U₁,…,U_n distributed uniformly on [0,1]^d, d1, in which two distinct such points are joined by an edge if the l_∞-distance between them is at most some prescribed value 0<x<1. The connectivity distance c_n, the smallest x for which G_n(x) is connected, is shown to satisfy

(1)

For d2, the random graph G_n(x) behaves like a d-dimensional version of the random graphs of Erdös and Rényi, despite the fact that its edges are not independent: c_n/d_n→1, a.s., as n→∞, where d_n is the largest nearest-neighbor link, the smallest x for which G_n(x) has no isolated vertices.     

图的介值定理的变异形式(英)

本文对目前已知的图的一系列介值定理给出了几种变异形式．     

关于Δ(G)=5的2-连通外平面图的邻点可区别全色数

给出了Δ(G)=5的2-连通外平面图的邻点可区别全色数.     

Codes from Generalized Hexagons

In this paper, we construct some codes that arise from generalized hexagons with small parameters. As our main result we discover two new projective two-weight codes constructed from two-character sets in PG(5,4) and PG(11,2). These in turn are constructed using a new distance-2-ovoid of the classical generalized hexagon H(4). Also the corresponding strongly regular graph is new. The two-character set is the union of two orbits in PG(5,4) under the action of L₂(13). Communicated by: R. Calderbank The first Author is Research Assistant of the Fund for Scientific Research - Flanders (Belgium) (F.W.O)     

构造色等价图的几种新方法

给出了构造伴随等价图的几种新方法，因而也给出了构造色等价图的几种新方法。     

关于图论中完美对集的一个充分条件

在Tutte关于完美对集存在的充要条件基础上,针对具有偶数个（v个）顶点,且顶点的最小度数δ≥v/2-1的简单图G,通过构造的连接方法,论证了图G中有完美对集的充分条件.