Connectivity keeping edges in graphs with large minimum degree

The old well-known result of Chartrand, Kaugars and Lick says that every k-connected graph G with minimum degree at least 3k/2 has a vertex v such that G−v is still k-connected. In this paper, we consider a generalization of the above result [G. Chartrand, A. Kaigars, D.R. Lick, Critically n-connected graphs, Proc. Amer. Math. Soc. 32 (1972) 63–68]. We prove the following result:Suppose G is a k-connected graph with minimum degree at least 3k/2+2. Then G has an edge e such that G−V(e) is still k-connected.The bound on the minimum degree is essentially best possible.     

Edge ranking and searching in partial orders

We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farchi and Newman considered a special case where the partial order has the maximum element and the Hasse diagram is a tree (tree-like posets) and they gave an O(n⁴log³n)-time algorithm for finding an optimal search strategy for such a partial order. We show that this problem is equivalent to finding edge ranking of a simple tree corresponding to the Hasse diagram, which implies the existence of a linear-time algorithm for this problem.Then we study a more general problem, namely searching in any partial order with maximum element. We prove that such a generalization is hard, and we give an -approximate polynomial-time algorithm for this problem.     

Degree constrained subgraphs

In this paper, we present new structural results about the existence of a subgraph where the degrees of the vertices are pre-specified. Further, we use these results to prove a 16-edge-weighting version of a conjecture by Karoński, ?uczak and Thomason, an asymptotic 2-edge-weighting version of the same conjecture, and a version of Louigi's Conjecture.     

Size of Monochromatic Double Stars in Edge Colorings

We show that in every r-coloring of the edges of K _n there is a monochromatic double star with at least \(\frac{n(r+1)+r-1}{r^2}\) vertices. This result is sharp in asymptotic for r = 2 and for r≥ 3 improves a bound of Mubayi for the largest monochromatic subgraph of diameter at most three. When r-colorings are replaced by local r-colorings, our bound is \(\frac{n(r+1)+r-1}{r^2+1}\).     

Dynamics of plasma channel in a parallel-plate plasma gun

Lumped parameter models for describing dynamics of the plasma channel in a parallel-plate plasma gun are compared with the experimental results obtained from two plasma guns with different rail geometries. Comparison between the experiments and the numerical calculations reveals that the lumped parameter models can be utilized to describe the dynamic motion of the plasma channel quite well. Parametric study shows that minimizing the line inductance and increasing the charging voltage on a capacitor as well as minimizing the gas injection time for reducing the mass of the plasma channel are the key factors to increase the flow velocity of the plasma jet ejected from the plasma gun.     

An improved edge detection algorithm for depth map inpainting

Three-dimensional (3D) measurement technology has been widely used in many scientific and engineering areas. The emergence of Kinect sensor makes 3D measurement much easier. However the depth map captured by Kinect sensor has some invalid regions, especially at object boundaries. These missing regions should be filled firstly. This paper proposes a depth-assisted edge detection algorithm and improves existing depth map inpainting algorithm using extracted edges. In the proposed algorithm, both color image and raw depth data are used to extract initial edges. Then the edges are optimized and are utilized to assist depth map inpainting. Comparative experiments demonstrate that the proposed edge detection algorithm can extract object boundaries and inhibit non-boundary edges caused by textures on object surfaces. The proposed depth inpainting algorithm can predict missing depth values successfully and has better performance than existing algorithm around object boundaries.     

On edge connectivity and parity factor

By Petersen's Theorem, a bridgeless cubic graph has a 2-factor. Fleischner(Discrete Math.,101, 33–37(1992)) has extended this result to bridgeless graphs of minimum degree at least three by showing that every such graph has an even factor without isolated vertices. Let me 0 be even and mo 0 be odd. In this paper, we prove that every m e-edge-connected graph with minimum degree at least me + 1 contains an even factor with minimum degree at least m e and every(m o + 1)-edge-connected graph contains an odd factor with minimum degree at least m o, which further extends Fleischner's result. Moreover, we show that our results are best possible.     

Influences of stoichiometry on steadily propagating triple flames in counterflows

Most studies of triple flames in counterflowing streams of fuel and oxidizer have been focused on the symmetric problem in which the stoichiometric mixture fraction is 1/2. There then exist lean and rich premixed flames of roughly equal strengths, with a diffusion flame trailing behind from the stoichiometric point at which they meet. In the majority of realistic situations, however, the stoichiometric mixture fraction departs appreciably from unity, typically being quite small. With the objective of clarifying the influences of stoichiometry, attention is focused on one of the simplest possible models, addressed here mainly by numerical integration. When the stoichiometric mixture fraction departs appreciably from 1/2, one of the premixed wings is found to be dominant to such an extent that the diffusion flame and the other premixed flame are very weak by comparison. These curved, partially premixed flames are expected to be relevant in realistic configurations. In addition, a simple kinematic balance is shown to predict the shape of the front and the propagation velocity reasonably well in the limit of low stretch and low curvature.     

Sizable band gap in organometallic topological insulator

Based on first principle calculation when Ceperley–Alder and Perdew–Burke–Ernzerh type exchange-correlation energy functional were adopted to LSDA and GGA calculation, electronic properties of organometallic honeycomb lattice as a two-dimensional topological insulator was calculated. In the presence of spin–orbit interaction bulk band gap of organometallic lattice with heavy metals such as Au, Hg, Pt and Tl atoms were investigated. Our results show that the organometallic topological insulator which is made of Mercury atom shows the wide bulk band gap of about ∼120 meV. Moreover, by fitting the conduction and valence bands to the band-structure which are produced by Density Functional Theory, spin–orbit interaction parameters were extracted. Based on calculated parameters, gapless edge states within bulk insulating gap are indeed found for finite width strip of two-dimensional organometallic topological insulators.     

HL-2A 装置超声分子束注入缓解偏滤器靶板上边缘局域模热通量研究

在HL-2A 装置上优化和发展了偏滤器靶板上的红外测温系统,并利用该系统分析了高约束模放电期间边缘局域模的热沉积分布特性。在高约束模式放电期间,超声分子束注入使边缘局域模所引起的偏滤器靶板上瞬间热通量峰值下降了~60%,并伴随着边缘局域模爆发频率增加了2~3 倍,而等离子体储能仅下降了~8%。分析结果表明,大幅度的丝状结构在超声分子束注入之后得到了有效抑制,沉积到偏滤器靶板上的瞬间热通量峰值也随之下降。此外,在超声分子束注入之后偏滤器室内的热辐射损失大幅度增加,从而耗散了热输运所携带的部分能量,进一步分散了沉积到偏滤器靶板上的能量,有效地保护了偏滤器靶板。