Explicit 2-Factorisations of the Odd Graph

In this note we show how 1-factors in the middle two layers of the discrete cube can be used to construct 2-factors in the Odd graph (the Kneser graph of (k − 1)-sets from a (2k − 1)-set). In particular, we use the lexical matchings of Kierstead and Trotter, and the modular matchings of Duffus, Kierstead and Snevily, to give explicit constructions of two different 2-factorisations of the Odd graph. This revised version was published online in September 2006 with corrections to the Cover Date.     

Bounds for the Least Laplacian Eigenvalue of a Signed Graph

A signed graph is a graph with a sign attached to each edge. This paper extends some fundamental concepts of the Laplacian matrices from graphs to signed graphs. In particular, the relationships between the least Laplacian eigenvalue and the unbalancedness of a signed graph are investigated.     

非空交定理及其应用

本文得到了广义区间空间中几个参数型非空交定理，并用此结果证明了一些新型极大极小定理，截口定理，重合定理，以及变分不等式解的存在性定理。本文中的结果包含（１，３，５－１２，１４－１６）中相应结果。     

The Nonexistence of Procedures with Bounded Performance Characteristics in Certain Parametric Inference Problems

This paper gives a condition which implies the nonexistence of parametric statistical procedures with bounded risk or error performance characteristics. Many examples for which such a condition is satisfied are considered.     

On potentially <Emphasis Type="Italic">H</Emphasis>-graphic sequences

For given a graph H, a graphic sequence π = (d ₁, d ₂,..., d _n) is said to be potentially H-graphic if there is a realization of π containing H as a subgraph. In this paper, we characterize the potentially (K ₅ − e)-positive graphic sequences and give two simple necessary and sufficient conditions for a positive graphic sequence π to be potentially K ₅-graphic, where K _r is a complete graph on r vertices and K _r-e is a graph obtained from K _r by deleting one edge. Moreover, we also give a simple necessary and sufficient condition for a positive graphic sequence π to be potentially K ₆-graphic. Project supported by National Natural Science Foundation of China (No. 10401010).     

Drawing c-planar biconnected clustered graphs

In a graph, a cluster is a set of vertices, and two clusters are said to be non-intersecting if they are disjoint or one of them is contained in the other. A clustered graph C consists of a graph G and a set of non-intersecting clusters. In this paper, we assume that C has a compound planar drawing and each cluster induces a biconnected subgraph. Then we show that such a clustered graph admits a drawing in the plane such that (i) edges are drawn as straight-line segments with no edge crossing and (ii) the boundary of the biconnected subgraph induced by each cluster is a convex polygon.     

属性区间识别理论模型研究及其应用

根据程乾生教授创立的属性识别理论模型[1] ,提出了属性测度区间的概念 ,建立了属性区间识别理论模型 ,并在自然科学学术期刊质量评价中进行了应用 .     

CALCULUS OF VARIATIONS WITH DIRICHLET BOUNDARY VALUE PROBLEM FOR PERTURBED SECOND-ORDER DIFFERENTIAL EQUATIONS ON A HALF-LINE

Dirichlet boundary value problems for perturbed second-order differential equations on a half line are investigated in this paper. The methods mainly depend on the calculus of variations to the classical functionals. Sufficient conditions are obtained for the existence of the solutions.     

Partitioning series-parallel multigraphs into ν *-excluding edge covers

We prove that, for any given vertex ν* in a series-parallel graph G, its edge set can be partitioned into κ = min{κ′(G) + 1, δ(G)} subsets such that each subset covers all the vertices of G possibly except for ν*, where δ(G) is the minimum degree of G and κ′(G) is the edge-connectivity of G. In addition, we show that the results in this paper are best possible and a polynomial time algorithm can be obtained for actually finding such a partition by our proof.     

Sizes of Critical Graphs with Small Maximum Degrees

In this paper, we give new lower bounds for the size of Δ-critical graphs with Δ=8,9 which improve the partial results of Luo [6] and Y. Zhao [12].