双圈拟阵

Sim■es Pereira于1992年提出双圈拟阵.本文讨论了(i)双圈拟阵及其秩函数;(ii)次模函数在双圈拟阵中的应用;(iii)双圈拟阵B(G)的横贯拟阵.主要结果:1°由圈矩阵Bf=[I,Bf12]和圈秩的概念,推出M(f0)为双圈拟阵;2°证明了双圈拟阵B(G)等于由子集族{Av∶v∈V(G)},e与v在G中相关联}所确定的横贯拟阵;3°用不同于Matthews(1977)的方法证明了(iii).     

关于多重联图的均匀全染色

对一个正常的全染色满足各种颜色所染元素数(点或边)相差不超过1时,称为均匀全染色,其所用最少染色数称为均匀全色数．本文证明了关于多重联图的若干情况下的均匀全色数定理,得到了若干特殊多重联图的均匀全色数．     

关于联图K_(2,n)∨P_m的邻点可区别的全染色

一个全染色被称为邻点可区别的如果它满足对任意两个相邻点所关联的色集合不同.本文给出了联图K2,n∨Pm的邻点可区别的全色数并且证明了它满足邻点可区别的全染色猜想.     

An approximation result for the interval coloring problem on claw-free chordal graphs

We study the problem of finding an acyclic orientation of an undirected graph, such that each (oriented) path is covered by a limited number k of maximal cliques. This is equivalent to finding a k-approximate solution for the interval coloring problem on a graph. We focus our attention on claw-free chordal graphs, and show how to find an orientation of such a graph in linear time, which guarantees that each path is covered by at most two maximal cliques. This extends previous published results on other graph classes where stronger assumptions were made.     

不同负冲角工况下透平叶栅二次流的数值模拟及分析

本文应用TVD格式和Baldwin－Lomax代数紊流模型求解三维NS方程，对一个透平直列叶栅流场在两个不同的负冲角工况下进行了数值模拟，给出了叶栅马蹄涡及其分离鞍点、通道涡、角涡等二次流涡系的结构及其产生发展过程，并对不同工况下的涡系结构及冲角的影响作了详细的分析和比较．本文结果有助于对叶栅二次流涡系结构的产生发展机制的深入了解，同时表明所用数值求解技术有较高的精度和分辨率。     

Bounded Bose Fields

Examples for bounded Bose fields in two dimensions are presented.     

0－1多面体图连通度猜想的一个反例

本文给出０－１多面体图连通度猜想的一个反侧．由此说明０－１多面体图的连通度未必等于最小度．     

医院医疗服务质量管理的灰关联分析

将灰关联分析方法应用于医院管理年活动中,分析了影响医疗服务质量的相关因素,并对医院医疗服务质量进行综合评价.     

Forcing highly connected subgraphs

A theorem of Mader states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. We extend this result to infinite graphs. Here, it is necessary to require not only high degree for the vertices but also high vertex‐degree (or multiplicity) for the ends of the graph, that is, a large number of disjoint rays in each end. We give a lower bound on the degree of vertices and the vertex‐degree of the ends which is quadratic in k, the connectedness of the desired subgraph. In fact, this is not far from best possible: we exhibit a family of graphs with a degree of order 2^k at the vertices and a vertex‐degree of order k log k at the ends which have no k‐connected subgraphs. Furthermore, if in addition to the high degrees at the vertices, we only require high edge‐degree for the ends (which is defined as the maximum number of edge‐disjoint rays in an end), Mader's theorem does not extend to infinite graphs, not even to locally finite ones. We give a counterexample in this respect. But, assuming a lower bound of at least 2k for the edge‐degree at the ends and the degree at the vertices does suffice to ensure the existence (k + 1)‐edge‐connected subgraphs in arbitrary graphs. © 2006 Wiley Periodicals, Inc. J Graph Theory 54: 331–349, 2007     

Quadruple systems of the projective special linear group PSL(2,q), q ≡ 1 (mod 4)

We determine the distribution of quadruple systems among the orbits of 4‐element subsets under the action of PSL(2,q) on the projective line when q ≡ 1 (mod 4). © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 339–351, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10043