基于层次分析和FAD图的管道环焊缝适用性评价方法

焊缝缺陷是导致管道失效的主要原因之一,因此在役长输管道在进行升压前或复产前,应对管道全线环焊缝进行适用性评价,以排除管道隐患并确定合适的压力范围。由于管道的敷设位置大多位于地下,焊缝处的载荷参数难以准确获取,现有的环焊缝适用性评价多是仅仅基于管道内压进行评价,忽略附加载荷的影响,导致评价结果不准确。针对上述情况,本文以某天然气长输管道环焊缝开挖后的无损检测结果为基础数据,建立待评价焊缝处附加载荷的层次分析风险因素模型,改进了API 579中失效评估图（failure assessment diagram,FAD）传统评价方法,实现管道环焊缝的精准适用性评价,为管道安全提供决策支持。该方法与准则对在役长输管道全线路环焊缝适用性评价工程实践具有借鉴意义。

     

The circular chromatic number of series‐parallel graphs

In this article, we consider the circular chromatic number χ_c(G) of series‐parallel graphs G. It is well known that series‐parallel graphs have chromatic number at most 3. Hence, their circular chromatic numbers are at most 3. If a series‐parallel graph G contains a triangle, then both the chromatic number and the circular chromatic number of G are indeed equal to 3. We shall show that if a series‐parallel graph G has girth at least 2 ⌊(3k − 1)/2⌋, then χ_c(G) ≤ 4k/(2k − 1). The special case k = 2 of this result implies that a triangle free series‐parallel graph G has circular chromatic number at most 8/3. Therefore, the circular chromatic number of a series‐parallel graph (and of a K₄‐minor free graph) is either 3 or at most 8/3. This is in sharp contrast to recent results of Moser [5] and Zhu [14], which imply that the circular chromatic number of K₅‐minor free graphs are precisely all rational numbers in the interval [2, 4]. We shall also construct examples to demonstrate the sharpness of the bound given in this article. © 2000 John Wiley & Sons, Inc. J Graph Theory 33: 14–24, 2000     

Group edge choosability of planar graphs without adjacent short cycles

In this paper,we prove that 2-degenerate graphs and some planar graphs without adjacent short cycles are group(Δ(G)+1)-edge-choosable,and some planar graphs with large girth and maximum degree are groupΔ(G)-edge-choosable.     

有限维单Cartan型模李超代数HO

本文构造了一族有限维Cartan型模李超代数-奇Hamilton模李超代数HO, 并证明了其单性.通过建立Cartan型模李超代数W,H,K,S和HO的维数公式,讨 论了奇Hamilton模李超代数HO与Cartan型模李超代数W,S,H,K的同构关系.     

Stable sets, corner polyhedra and the Chvátal closure

We consider the edge formulation of the stable set problem. We characterize its corner polyhedron, i.e. the convex hull of the points satisfying all the constraints except the non-negativity of the basic variables. We show that the non-trivial inequalities necessary to describe this polyhedron can be derived from one row of the simplex tableau as fractional Gomory cuts. It follows that the split closure is not stronger than the Chvátal closure for the edge relaxation of the stable set problem.     

Odd connection and odd vertex-connection of graphs

In the last years, connection concepts such as rainbow connection and proper connection appeared in graph theory and received a lot of attention. In this paper, we present a general concept of connection in graphs. As a particular case, we introduce the odd connection number and the odd vertex-connection number of a graph. Furthermore, we compute and study the odd connection number and the odd vertex-connection number of graphs of various graph classes.     

Finding odd cycle transversals

We present an O(mn) algorithm to determine whether a graph G with m edges and n vertices has an odd cycle transversal of order at most k, for any fixed k. We also obtain an algorithm that determines, in the same time, whether a graph has a half integral packing of odd cycles of weight k.