给定度序列图的覆盖成本和反向覆盖成本的研究

具有n个顶点且度序列为(m,2,…,2,1,…,1)(1的重数为m)的连通图不止一个(这些图均为树),而每个树对应唯一一个段序列(l₁,l₂,…,l_m).通过对任意一树移动最长段的悬挂点到最短段悬挂点的方式得到另一树,比较前后两树的覆盖成本和反向覆盖成本,给出了具有最小覆盖成本和反向覆盖成本的极树,并且进一步给出了取得最小覆盖成本和反向覆盖成本的顶点.     

白云石制备似立方体状方解石型碳酸钙晶体及其机理研究

以轻烧白云石粉、氯化铵和二氧化碳为原料,在未使用晶型控制剂的情况下,通过蒸氨-沉钙过程制备出了似立方体状碳酸钙。研究了反应温度、溶液中钙离子浓度、通气速率、搅拌速度以及陈化时间对碳酸钙中方解石相含量以及晶体形貌的影响,并探索了沉钙反应的晶型控制机理。结果表明,在反应温度40 ℃、钙离子浓度0.05 mol/L、通碳速率100 mL/min、搅拌速度400 r/min和陈化时间2 h的条件下,制备出形貌规整、粒径分布均匀的似立方体状碳酸钙,平均粒径为5~10 μm。该研究为提升白云石的使用价值、生产高附加价值的碳酸钙产品,以及提高白云石资源的利用率提供理论基础。     

Discussion of “Virtual age,is it real?”

In this note, some point of views on virtual ages are presented in terms of the discussion paper written by Finkelstein and Cha, which include generalized stochastic order‐based virtual ages, system‐level virtual ages, virtual ages in Weibull distribution and repair degrees with virtual ages. Finally, some possible future researches on virtual ages are described.     

椰心叶甲虫综合防治脉冲动力学模型的周期解

椰心叶甲虫是棕榈科植物最主要的害虫之一.论文针对两类寄生蜂攻击椰心叶甲虫不同年龄阶段的特点,建立了阶段结构的脉冲定期喷洒药物和释放天敌的综合防治模型.通过重合度理论和分析工具,证明了该模型周期解的存在性,给出了周期解存在的充分条件,并通过数值模拟验证了理论结果的有效性.     

Gallai’s path decomposition conjecture for graphs of small maximum degree

Gallai’s path decomposition conjecture states that the edges of any connected graph on $n$ vertices can be decomposed into at most $\frac{n+1}{2}$ paths. We confirm that conjecture for all graphs with maximum degree at most five.     

Vertex-disjoint rainbow triangles in edge-colored graphs

Let $G$ be an edge-colored graph of order $n$. The minimum color degree of $G$, denoted by ${\delta }^c\left(G\right)$, is the largest integer $k$ such that for every vertex $v$, there are at least $k$ distinct colors on edges incident to $v$. We say that an edge-colored graph is rainbow if all its edges have different colors. In this paper, we consider vertex-disjoint rainbow triangles in edge-colored graphs. Li (2013) showed that if ${\delta }^c\left(G\right)\ge (n+1)∕2$, then $G$ contains a rainbow triangle and the lower bound is tight. Motivated by this result, we prove that if $n\ge 20$ and ${\delta }^c\left(G\right)\ge (n+2)∕2$, then $G$ contains two vertex-disjoint rainbow triangles. In particular, we conjecture that if ${\delta }^c\left(G\right)\ge (n+k)∕2$, then $G$ contains $k$ vertex-disjoint rainbow triangles. For any integer $k\ge 2$, we show that if $n\ge 16k-12$ and ${\delta }^c\left(G\right)\ge n∕2+k-1$, then $G$ contains $k$ vertex-disjoint rainbow triangles. Moreover, we provide sufficient conditions for the existence of $k$ edge-disjoint rainbow triangles.     

Sufficient Conditions for a Digraph to be Supereulerian

A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs.