若干图类的邻强边染色

研究了若干图类的邻强边染色 .利用在图中添加辅助点和边的方法 ,构造性的证明了对于完全图 Kn和路 Lm 的笛卡尔积图 Kn× Lm,有χ′as(Kn× Lm) =△ (Kn× Lm) +1 ,其中△ (Kn× Lm)和χ′as(Kn× Lm)分别表示图 Kn× Lm的最大度和邻强边色数 .同理验证了 n阶完全图 Kn的广义图 K(n,m)满足邻强边染色猜想 .     

4一致反超图的最小边数问题

混合超图是在超图的基础上添加一个反超边得到的图．超边和反超边的区别主要体现在着色要求上．在着色中,要求每一超边至少要有两个点着不同的颜色,而每一反超边至少有两个点着相同的颜色．最大最小颜色数分别称为混合超图的上色数和下色数。本文主要研究反超图,即只含反超边的超图。讨论了上色数为3的4一致超图的最小边数问题．给出了上色数为3的4一致反超图的最小边数的一个上界和一个下界．     

连续照明时成像对比度与气象条件的关系

 通过同轴激光连续照明成像模型分析了大气后向散射对成像对比度的影响，得出了考虑散射因素时成像对比度的计算公式。基于不同气象条件下大气粒子散射特点，讨论了霾和雾两种不同天气时成像对比度随照明距离的变化规律，并与实验结果进行了对比，计算结果与实验吻合较好。     

Halin-图的点强全染色

图G(V,E)的一个k-正常全染色f叫做一个k-点强全染色当且仅当对任意v∈V(G), N[v]中的元素被染不同色,其中N[v]={u|uv∈V(G)}∪{v}．χTvs(G)=min{k|存在图G的k- 点强全染色}叫做图G的点强全色数．对3-连通平面图G(V,E),如果删去面fo边界上的所有点后的图为一个树图,则G(V,E)叫做一个Halin-图．本文确定了最大度不小于6的Halin- 图和一些特殊图的的点强全色数XTvs(G),并提出了如下猜想:设G(V,E)为每一连通分支的阶不小于6的图,则χTvs(G)≤△(G) 2,其中△(G)为图G(V,E)的最大度．     

具连续分布滞量的非线性中立型抛物偏泛函微分方程的振动性

考虑一类具连续分布滞量的非线性中立型抛物偏泛函微分方程解的振动性,借助Green定理和时滞微分不等式获得了这类方程在Robin,Dirichlet边值条件下所有解振动的若干充分条件.     

A note on continuously decomposed evolving exchange economies

It is routine to demonstrate in the exchange economy framework that small changes of individual preferences and endowments always result in small changes of the derived excess demand functions as one should expect. Though being as desirable for reasons of the consistency of the whole approach, however, a precise proof of the converse direction so far is still open to question. The present paper shows that it is actually true. We use a decomposition method for aggregate excess demand functions developed by Mas-Colell which is derived from the well-known decomposition method developed by Sonnenschein and perfected by Debreu and Mantel. Our result fills in a notorious gap in the line of economic justification usually given for this decomposition, or disaggregation, method in that comparative static analysis would be restricted if the decomposition of excess demand functions would not be continuous.     

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.