两类拟共形映射的掩盖定理

In this paper we define two classes of quasiconformal mappings,and study their covering properties by methods of module.We obtain some new results.In the meantime,we give new methods to prove Koebe 1/2 covering theorem on convex conformal mappings.     

Codiameters of 3‐connected 3‐domination critical graphs

A graph G is 3‐domination critical if its domination number γ is 3 and the addition of any edge decreases γ by 1. Let G be a 3‐connected 3‐domination critical graph of order n. In this paper, we show that there is a path of length at least n?2 between any two distinct vertices in G and the lower bound is sharp. © 2002 John Wiley & Sons, Inc. J Graph Theory 39: 76–85, 2002     

泛连通图定理和Ore2条件

记Ore2=min{d(y) d(x)|x,y∈V(G),d(x,y)=2}，本得到：若n阶图G的Ore2≥n 1，则G是[5;n]泛连通图。此是比Faudree等人的定理进一步的结果。     

Maximal σ‐polynomials of connected 3‐chromatic graphs

In the set of graphs of order n and chromatic number k the following partial order relation is defined. One says that a graph G is less than a graph H if c_i(G) ≤ c_i(H) holds for every i, k ≤ i ≤ n and at least one inequality is strict, where c_i(G) denotes the number of i‐color partitions of G. In this paper the first ? n/2 ? levels of the diagram of the partially ordered set of connected 3‐chromatic graphs of order n are described. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 210–222, 2003     

关于k—消去图的若干新结果

设G是一个图．k是自然数．图G的一个k-正则支撑子图称为G的一个k-因子．若对于G的每条边e．G—e都存在一个k-因子，则称G是一个k-消去图．该文得到了一个图是k-消去图的若干充分条件，推广了文［2—4］中有关结论．     

Odd subgraphs and matchings

Let G be a graph and f : V(G)→{1,3,5,…}. Then a subgraph H of G is called a (1,f)-odd subgraph if deg_H(x){1,3,…,f(x)} for all xV(H). If f(x)=1 for all xV(G), then a (1,f)-odd subgraph is nothing but a matching. A (1,f)-odd subgraph H of G is said to be maximum if G has no (1,f)-odd subgraph K such that |K|>|H|. We show that (1,f)-odd subgraphs have some properties similar to those of matchings, in particular, we give a formula for the order of a maximum (1,f)-odd subgraph, which is similar to that for the order of a maximum matching.     

分段函数的分类及分离型分段函数与初等函数之间的关系

将分段函数划分为连结型分段函数 ,分离型分段函数和它们的组合形式三种类型 ,得到了分离型分段函数是初等函数的充分必要条件 ,完整地解决了分离型分段函数与初等函数之间的关系 ,并且给出了初等函数在其任一截取集上的限制函数 (截取函数 )仍然是初等函数的结果     

Dynamic behavior of discrete-time multiagent systems with general communication structures

In this paper, we discuss the dynamic behavior of networks of dynamic agents with general communication topologies. We first analyze the basic case: systems with communication topologies that have spanning trees, i.e., the systems that solve consensus problems. We establish an algebraic condition to characterize each agent's contributions to the final state. And we also study the influence of time-delays on each agent's contributions. Then, we investigate the general case: systems with weakly connected topologies. By using matrix theory, we prove that the states of internal agents will converge to a convex combination of boundary agents in the absence or presence of communication time-delays, and we also show that the coefficients of the convex combination are independent of time-delays even if the delays are time-varying. These results have broad applications in other areas, e.g., study of swarm behavior, formation control of vehicles, etc.     

Estimations of subgraph positions in molecular graphs and their common subgraph peculiarities

Some questions emerged from electronic data processing of molecular structures (graphs) and its fragments have been considered in this work. Quantitative estimations of subgraph positions in molecular graphs are presented and some properties of their maximal common subgraphs are described.     

Separation of mixtures of solvents with wide bore capillary columns connected in series

The gas chromatographic separation of the components of a complex mixture of industrial solvents, not possible on a single stationary phase owing to coelution of some of the compounds, has been achieved on two serially connected wide bore capillary columns of different polarity. The analysis of a mixture of twenty five compounds was optimized using the serial gas chromatography theory of Purnell and Williams. The capacity factors of sample components measured with the two columns coupled in series were found to agree with those predicted by theory, regardless of the order in which they were connected.