给定围长的三圈图的无符号拉普拉斯谱半径

A tricyclic graph G =（V（G）, E（G）） is a connected and simple graph such that｜E（G）｜ = ｜V（G）｜＋2. Let Tg nbe the set of all tricyclic graphs on n vertices with girth g. In this paper, we will show that there exists the unique graph which has the largest signless Laplacian spectral radius among all tricyclic graphs with girth g containing exactly three（resp., four）cycles. And at the same time, we also give an upper bound of the signless Laplacian spectral radius and the extremal graph having the largest signless Laplacian spectral radius in Tg n,where g is even.     

On the number of distinct prime factors of an odd perfect number

It is not known whether or not there exists an odd perfect number. We describe an algorithmic approach for showing that if there is an odd perfect number then it has t distinct prime factors, and we discuss its application towards showing that t9.     

decay problem for the dissipative wave equation in odd dimensions

Consider the Cauchy problem in odd dimensions for the dissipative wave equation: (□+∂_t)u=0 in with (u,∂_tu)|_t=0=(u₀,u₁). Because the L² estimates and the L^∞ estimates of the solution u(t) are well known, in this paper we pay attention to the L^p estimates with 1p<2 (in particular, p=1) of the solution u(t) for t0. In order to derive L^p estimates we first give the representation formulas of the solution u(t)=∂_tS(t)u₀+S(t)(u₀+u₁) and then we directly estimate the exact solution S(t)g and its derivative ∂_tS(t)g of the dissipative wave equation with the initial data (u₀,u₁)=(0,g). In particular, when p=1 and n1, we get the L¹ estimate: u(t)_L¹Ce^−t/4(u_0W^n,1+u_1W^n−1,1)+C(u_0L¹+u_1L¹) for t0.     

Gauss整环上不可分解的Hermite型

本文给出了构作虚二次域Ｑ（－ｍ）的整数环上不可分解的正定整Ｈｅｒ ｍｉｔｅ型的方法．     

第Ⅱ类三态叠加多模叠加态光场等幂次2m+1次方Y压缩

构造了由多模虚相干态|{iZ_j}>_q、多模虚相干态的相反态|{-iZ_j}>_q和多模真空态|{O_j}>_q这三种不同的量子光场态的线性叠加所组成的第Ⅱ类三态叠加多模叠加态光场|ψ₂⁽³⁾>_q.利用多模压缩态理论,研究了态|ψ₂⁽³⁾>_q的广义非线性等幂次2m+1次方Y压缩特性.结果发现:在压缩次数N=2m+1(m=0,1,2,3,…,…)的条件下,只要各模的初始相位和态间的初始相位差分别满足一定的取值条件,态|ψ₂⁽³⁾>_q就可呈现出周期性变化的、任意奇数次的广义非线性等幂次N次方Y压缩效应.     

K‐linked graphs with girth condition

Recently, Mader [ 7 ] proved that every 2k‐connected graph with girth g(G) sufficiently large is k‐linked. We show here that g(G ≥ 11 will do unless k = 4,5. If k = 4,5, then g(G) ≥ 19 will do. © 2003 Wiley Periodicals, Inc. J Graph Theory 45: 48–50, 2004     

Thermodynamics of fusion and sublimation for a homologous series of eleven alkane-α,ω-diols HO-(CH2)n-OH: Structure-related odd–even effect

Temperatures and enthalpies of fusion and solid-to-solid transition of a homologous series of linear alkane-α,ω-diols, HO-(CH₂)_n-OH where n = (6 to 16), were measured by differential scanning calorimetry (d.s.c.). The enthalpies and temperatures of fusion displayed a marked odd–even effect as a function of the number of methylene groups in the alkyl chains, with even terms showing higher values than odd terms. Thermodynamic parameters of fusion were compared with those of isoelectronic linear alkanes and earlier measured alkane-α,ω-diamines, alkane-α,ω-diamides and alkane-α,ω-dinitriles. Results were discussed with reference to the effects of chain length on crystal structures and packing patterns raised on hydrogen bonding and hydrophobic interaction interplay. The enthalpies of sublimation at T = 298.15 K were obtained from the enthalpies of fusion and the literature enthalpies of vaporisation, both adjusted to 298.15 K. A smoother odd–even pattern was observed for the enthalpies of sublimation.     

平面图的k-重(2k+2)-染色

G=(V,E)表示一个顶点集为V,边集为E的有限简单无向图.若存在映射φ:V(G)→Zk(n)(Zk(n)是由{1,2,…,n}的所有k-元子集构成的集合),满足:(A) uv∈E(G),有φ(u)∩φ(u)=θ,则称φ是G的一个k-重n-顶点染色.本文证明了奇围长至少为5k-7(k=4)或5k-9(k=6)的平面图G...