Hamiltonian N2‐locally connected claw‐free graphs

A graph G is N₂‐locally connected if for every vertex ν in G, the edges not incident with ν but having at least one end adjacent to ν in G induce a connected graph. In 1990, Ryjá?ek conjectured that every 3‐connected N₂‐locally connected claw‐free graph is Hamiltonian. This conjecture is proved in this note. © 2004 Wiley Periodicals, Inc. J Graph Theory 48: 142–146, 2005     

Enhancing the Bolzon–Schrefler–Zienkiewicz Constitutive Model for Partially Saturated Soil

This paper presents an enhanced version of the elasto-plastic model for partially saturated soil first proposed by Bolzon, Schrefler and Zienkiewicz in 1996, “BSZ” model, which uses the effective stress tensor and suction as independent stress variables. It is recalled that the effective stress tensor proposed by Lewis and Schrefler in 1982 is thermodynamically consistent and, compared with other choices of stress tensors, results particularly suitable for partially saturated soil mechanics. A hydraulic constitutive relationship and a hydraulic hysteresis are introduced in the model, to take into account the irreversible deformation during cyclic drying and wetting until structural collapse. For this reason the plastic rate of strain is split into the sum of two components: one depending on the effective stress tensor and the other one on suction. This is the new feature of the BSZ model. This enhanced model is then cast into a thermodynamical framework at macroscopic level and it is shown that it is possible to derive the constitutive law from the Helmholtz free energy and a dissipation function, both for associative and non- associative plasticity. Finally the model predictions have been compared with experimental data for Sion slime, with particular emphasis on the deviatoric part, and model predictions of hysteretic behaviour have been investigated in case of a wetting and drying cycle on compacted betonite–kaolin.     

Energy Spectrum Width and Nonequilibrium Energy of Rayleigh Waves Scattered on a Two-Dimensional Near-Surface Electron Layer

We obtain expressions for the energy spectrum widths of Rayleigh waves corresponding to their deformational coupling to Fermi and Boltzmann electrons in a two-dimensional layer near the surface of a semibounded solid. We evaluate the nonequilibrium energy of Rayleigh waves that depends on these widths and is caused by the same coupling to the corresponding hot electrons. We show that this energy is independent of the degeneracy degree of the electrons and is given by the mean energy of free Rayleigh waves heated up to temperature of the electrons. We find conditions under which the thermodynamics is determined by this nonequilibrium energy of Rayleigh waves in films of a certain thickness with Fermi electrons near the surface and by the equilibrium energy of bulk phonons in thicker samples. All the results are obtained using the Keldysh diagram technique applied to the case of semibounded media.     

Partially isometric dilations of noncommuting -tuples of operators

Given a row contraction of operators on a Hilbert space and a family of projections on the space that stabilizes the operators, we show there is a unique minimal joint dilation to a row contraction of partial isometries that satisfy natural relations. For a fixed row contraction the set of all dilations forms a partially ordered set with a largest and smallest element. A key technical device in our analysis is a connection with directed graphs. We use a Wold decomposition for partial isometries to describe the models for these dilations, and we discuss how the basic properties of a dilation depend on the row contraction.

     

Circular perfect graphs

For 1 ≤ d ≤ k, let K_k/d be the graph with vertices 0, 1, …, k ? 1, in which i ～j if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χ_c(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to K_k/d. The circular clique number ω_c(G) of G is the maximum of those k/d for which K_k/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χ_c(H) = ω_c(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, N_G[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, N_G[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P₅ (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph K_k/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005     

Line graphs of bipartite graphs with Hamiltonian paths

It is shown that, if t is an integer ≥3 and not equal to 7 or 8, then there is a unique maximal graph having the path P_t as a star complement for the eigenvalue ?2. The maximal graph is the line graph of K_m,m if t = 2m?1, and of K_m,m+1 if t = 2m. This result yields a characterization of L(G ) when G is a (t + 1)‐vertex bipartite graph with a Hamiltonian path. The graphs with star complement P_r ∪ P_s or P_r ∪ C_s for ?2 are also determined. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 137–149, 2003     

解读“节约型政府”

建设节约型政府是当前我国政府改革的必然要求。节约型政府模式的选择有其必然性。节约型政府应是廉价政府、廉洁政府、透明政府和效益政府。应通过加强节约型政府的制度建设、在行为方面加强政府自身建设、在各级政府中牢固树立节约理念和成本意识等措施全力，打造节约型政府。     

遗传算法模式理论研究

给出了多种交叉方式遗传算法的模式定理及相关的证明.该定理避免了遗传算法模式理论的不足,使模式理论更加准确、严格.     

Investigation of the mean free path of projectile fragments produced in 16O－Em collision at 60 A GeV

Results are presented for an investigation of the mean free path of projectile fragments with charge 3≤Z≤8, produced by 60 A GeV {}^{16}O in nuclear emulsion. No dependence of mean free path on the distance from the point of the fragment emission is observed and our result is consistent with the nonexistence of anomalons.     

基因组重排问题的一个近似算法

分子生物学中基因无方向的反向基因组重排问题在数学上已被证明是一个NP困难问题．基于断点图的概念，给出一个时间复杂性为O(max{b^(π)，nb(π)})，空间复杂性为0(n)的求其近似最优解的算法．其中n为基因组中基因个数，π=(π1,π2，…，πn)表示n个基因的一种排列，b(π)表示排列π中的断点数．数据实验的结果表明，该近似算法可以求得较好的结果．