List star edge coloring of k-degenerate graphs

A star edge coloring of a graph is a proper edge coloring such that every connected 2-colored subgraph is a path with at most 3 edges. Deng et al. and Bezegová et al. independently show that the star chromatic index of a tree with maximum degree $\Delta$ is at most $?\frac{3\Delta }{2}?$, which is tight. In this paper, we study the list star edge coloring of $k$-degenerate graphs. Let $c{h}_{st}^{\prime }\left(G\right)$ be the list star chromatic index of $G$: the minimum $s$ such that for every $s$-list assignment $L$ for the edges, $G$ has a star edge coloring from $L$. By introducing a stronger coloring, we show with a very concise proof that the upper bound on the star chromatic index of trees also holds for list star chromatic index of trees, i.e. $c{h}_{st}^{\prime }\left(T\right)\le ?\frac{3\Delta }{2}?$ for any tree $T$ with maximum degree $\Delta$. And then by applying some orientation technique we present two upper bounds for list star chromatic index of $k$-degenerate graphs.     

Erratum: The average degree of an edge-chromatic critical graph II

In the article “The average degree of an edge-chromatic critical graph II” by Douglas R. Woodall (J. Graph Theory 56 (2007), 194-218), it was claimed that the average degree of an edge-chromatic critical graph with maximum degree $\mathrm{\Delta }$ is at least $\text{◂⋅▸}\frac{2}{3}\left(\mathrm{\Delta }+1\right)$ if $\mathrm{\Delta }⩾2$, at least $\text{◂+▸}\frac{2}{3}\mathrm{\Delta }+1$ if $\mathrm{\Delta }⩾8$, and at least $\text{◂⋅▸}\frac{2}{3}\left(\mathrm{\Delta }+2\right)$ if $\mathrm{\Delta }⩾15$. Unfortunately there were mistakes in the proof of the last two of these results, which are now proved only if $\mathrm{\Delta }⩾18$ and $\mathrm{\Delta }⩾30$, respectively.     

Uniform random colored complexes

We present here random distributions on (D + 1)‐edge‐colored, bipartite graphs with a fixed number of vertices 2p. These graphs encode D‐dimensional orientable colored complexes. We investigate the behavior of those graphs as p→∞. The techniques involved in this study also yield a Central Limit Theorem for the genus of a uniform map of order p, as p→∞.     

Powers of edge ideals with linear resolutions

We show that if G is a gap-free and diamond-free graph, then I(G)^s has a linear minimal free resolution for every s≥2.     

水胁迫下典型盐生植被梭梭光谱特征分析

荒漠地区由于气候干燥，降水稀少，水分常成为制约植被生长的因素之一，水分胁迫对植物长势和产量的影响比任何其他胁迫都要大。随着高光谱技术的发展，国内外已有众多学者利用高光谱数据研究植被遭受胁迫作用，然而这些研究对象多集中于甜菜、棉花、玉米、水稻等作物，针对干旱区盐生植被遭受胁迫作用的研究较少。梭梭作为荒漠、半荒漠地区的典型盐生植被之一，具有极高的经济和生态效益。选择梭梭作为研究对象，培育一年生梭梭，并设置三个水分梯度，形成受不同水分量胁迫的梭梭。使用原始光谱、红边位置参数，结合植被指数及二维相关光谱研究其叶片光谱特征，为干旱区利用高光谱遥感监测盐生植被提供借鉴。结果表明：(1)分析梭梭叶片反射光谱曲线发现，在可见光至中红外各波段范围内，受不同水分量胁迫作用的梭梭叶片光谱反射率有显著差异。在可见光(350～610 nm)波段，各水分处理的梭梭叶片反射率依次为100 mL>500 mL>200 mL，这是由于100和200 mL水分促进梭梭内部叶绿素合成，使该波段反射率降低，而过多的水分(500 mL)对梭梭内部的叶绿素合成没有更大的促进作用。在红光区(611～738 nm)，随着水分量的增多，受不同水分量胁迫的梭梭叶片光谱反射率依次减小。在738～1 181和1 228～1 296 nm波段，受不同水分量胁迫作用的梭梭叶片光谱反射率为：200 mL>100 mL>500 mL；在1 182～1 227 nm波段，受不同水分量胁迫作用的梭梭叶片光谱反射率为：100 mL>200 mL>500 mL。这是由于植被细胞结构对近红外区域的反射率影响较大，因而受不同水分胁迫作用的梭梭叶片光谱反射率有显著差异。在1 300～1 365和1 392～1 800 nm波段，受各水分胁迫作用的梭梭叶片反射率为：100 mL>200 mL>500 mL。这表明在500 mL水分胁迫量范围内，水分越多，叶子的细胞液、细胞膜对水分的吸收能力越强，使得反射率下降。通过对原始光谱求取一阶导数并提取红边位置参数发现，各水分处理下的梭梭叶片一阶微分光谱曲线中红边位置未发生移动。这是由于梭梭在长期的干旱环境影响下，形成了特殊的适应机制，水分对其红边位置影响不敏感。(2)选取若干植被指数分析各水分处理下的梭梭光谱指数变化。当水分胁迫量由100 mL增至200 mL时，WI/NDWI，MSI和NDII指数值变化显著，可用于研究水分胁迫下梭梭的光谱特征。(3)使用二维相关光谱技术分析受各水分胁迫作用的梭梭光谱特征，得出在100 mL水分胁迫下，在536，643，1 219和1 653 nm波段处，吸收峰对水分的微扰敏感；在200 mL水分胁迫下，在846和1 083 nm波段处，吸收峰对水分的微扰敏感；在500 mL水分胁迫下，在835和1 067 nm波段处，吸收峰对水分的微扰敏感。总之，在近红外波段，与100 mL水分量相比，梭梭受200和500 mL水分量胁迫时，吸收峰对水分的微扰敏感度上升。由100 mL水分胁迫下梭梭的二维同步相关谱图可知，1 044和1 665 nm，1 072和903 nm，903和1 264 nm，1 230和1 061 nm波段处形成正交叉峰，表明这些波段处光谱强度随水分的干扰同时变化。     

Edge proximity and matching extension in projective planar graphs

A graph $G$ with at least $2m+2$ vertices is said to be distance $d$ $m$-extendable if, for any matching $M$ of $G$ with $m$ edges in which the edges lie at distance at least $d$ pairwise, there exists a perfect matching of $G$ containing $M$. In this paper we prove that every 5-connected triangulation on the projective plane of even order is distance 3 7-extendable and distance 4 $m$-extendable for any $m$.     

A higher resolution edge‐based finite volume method for the simulation of the oil–water displacement in heterogeneous and anisotropic porous media using a modified IMPES method

In this article, we present a higher‐order finite volume method with a ‘Modified Implicit Pressure Explicit Saturation’ (MIMPES) formulation to model the 2D incompressible and immiscible two‐phase flow of oil and water in heterogeneous and anisotropic porous media. We used a median‐dual vertex‐centered finite volume method with an edge‐based data structure to discretize both, the elliptic pressure and the hyperbolic saturation equations. In the classical IMPES approach, first, the pressure equation is solved implicitly from an initial saturation distribution; then, the velocity field is computed explicitly from the pressure field, and finally, the saturation equation is solved explicitly. This saturation field is then used to re‐compute the pressure field, and the process follows until the end of the simulation is reached. Because of the explicit solution of the saturation equation, severe time restrictions are imposed on the simulation. In order to circumvent this problem, an edge‐based implementation of the MIMPES method of Hurtado and co‐workers was developed. In the MIMPES approach, the pressure equation is solved, and the velocity field is computed less frequently than the saturation field, using the fact that, usually, the velocity field varies slowly throughout the simulation. The solution of the pressure equation is performed using a modification of Crumpton's two‐step approach, which was designed to handle material discontinuity properly. The saturation equation is solved explicitly using an edge‐based implementation of a modified second‐order monotonic upstream scheme for conservation laws type method. Some examples are presented in order to validate the proposed formulation. Our results match quite well with others found in literature. Copyright © 2016 John Wiley & Sons, Ltd.     

Multistrain edge‐based compartmental model on networks

Multistrain diseases, which are infected through individual contacts, pose severe public health threat nowadays. In this paper, we build competitive and mutative two‐strain edge‐based compartmental models using probability generation function (PGF) and pair approximation (PA). Both of them are ordinary differential equations. Their basic reproduction numbers and final size formulas are explicitly derived. We show that the formula gives a unique positive final epidemic size when the reproduction number is larger than unity. We further consider competitive and mutative multistrain diseases spreading models and compute their basic reproduction numbers. We perform numerical simulations that show some dynamical properties of the competitive and mutative two‐strain models.