Hamiltonian Cycle Systems Which Are Both Cyclic and Symmetric

The notion of a symmetric Hamiltonian cycle system (HCS) of a graph Γ has been introduced and studied by J. Akiyama, M. Kobayashi, and G. Nakamura [J Combin Des 12 (2004), 39–45] for , by R. A. Brualdi and M. W. Schroeder [J Combin Des 19 (2011), 1–15] for , and then naturally extended by V. Chitra and A. Muthusamy [Discussiones Mathematicae Graph Theory, to appear] to the multigraphs and . In each case, there must be an involutory permutation ψ of the vertices fixing all the cycles of the HCS and at most one vertex. Furthermore, for , this ψ should be precisely the permutation switching all pairs of endpoints of the edges of I. An HCS is cyclic if it is invariant under some cyclic permutation of all the vertices. The existence question for a cyclic HCS of has been completely solved by Jordon and Morris [Discrete Math (2008), 2440–2449]—and we note that their cyclic construction is also symmetric for (mod 8). It is then natural to study the existence problem of an HCS of a graph or multigraph Γ as above which is both cyclic and symmetric. In this paper, we completely solve this problem: in the case of even order, the final answer is that cyclicity and symmetry can always cohabit when a cyclic solution exists. On the other hand, imposing that a cyclic HCS of odd order is also symmetric is very restrictive; we prove in fact that an HCS of with both properties exists if and only if is a prime.     

Characterizations of competition multigraphs

The notion of a competition multigraph was introduced by C. A. Anderson, K. F. Jones, J. R. Lundgren, and T. A. McKee [C. A. Anderson, K. F. Jones, J. R. Lundgren, and T. A. McKee: Competition multigraphs and the multicompetition number, Ars Combinatoria 29B (1990) 185-192] as a generalization of the competition graphs of digraphs.In this note, we give a characterization of competition multigraphs of arbitrary digraphs and a characterization of competition multigraphs of loopless digraphs. Moreover, we characterize multigraphs whose multicompetition numbers are at most m, where m is a given nonnegative integer and give characterizations of competition multihypergraphs.     

Triple Systems are Eulerian

An Euler tour of a hypergraph (also called a rank‐2 universal cycle or 1‐overlap cycle in the context of designs) is a closed walk that traverses every edge exactly once. In this paper, using a graph‐theoretic approach, we prove that every triple system with at least two triples is eulerian, that is, it admits an Euler tour. Horan and Hurlbert have previously shown that for every admissible order >3, there exists a Steiner triple system with an Euler tour, while Dewar and Stevens have proved that every cyclic Steiner triple system of order >3 and every cyclic twofold triple system admits an Euler tour.     

Line graphs of multigraphs and Hamilton‐connectedness of claw‐free graphs

We introduce a closure concept that turns a claw‐free graph into the line graph of a multigraph while preserving its (non‐)Hamilton‐connectedness. As an application, we show that every 7‐connected claw‐free graph is Hamilton‐connected, and we show that the well‐known conjecture by Matthews and Sumner (every 4‐connected claw‐free graph is hamiltonian) is equivalent with the statement that every 4‐connected claw‐free graph is Hamilton‐connected. Finally, we show a natural way to avoid the non‐uniqueness of a preimage of a line graph of a multigraph, and we prove that the closure operation is, in a sense, best possible. © 2010 Wiley Periodicals, Inc. J Graph Theory 66:152‐173, 2011     

Supereulerian bipartite digraphs

A digraph D is supereulerian if D has a spanning closed ditrail. Bang‐Jensen and Thomassé conjectured that if the arc‐strong connectivity of a digraph D is not less than the independence number , then D is supereulerian. A digraph is bipartite if its underlying graph is bipartite. Let be the size of a maximum matching of D. We prove that if D is a bipartite digraph satisfying , then D is supereulerian. Consequently, every bipartite digraph D satisfying is supereulerian. The bound of our main result is best possible.     

A Combined Logarithmic Bound on the Chromatic Index of Multigraphs

For a multigraph G, the integer round‐up of the fractional chromatic index provides a good general lower bound for the chromatic index . For an upper bound, Kahn 1996 showed that for any real there exists a positive integer N so that whenever . We show that for any multigraph G with order n and at least one edge, ). This gives the following natural generalization of Kahn's result: for any positive reals , there exists a positive integer N so that + c whenever . We also compare the upper bound found here to other leading upper bounds.     

An Asymptotic Version of the Multigraph 1‐Factorization Conjecture

We give a self‐contained proof that for all positive integers r and all , there is an integer such that for all any regular multigraph of order 2n with multiplicity at most r and degree at least is 1‐factorizable. This generalizes results of Perkovi? and Reed (Discrete Math 165/166 (1997), 567–578) and Plantholt and Tipnis (J London Math Soc 44 (1991), 393–400).     

桁架结构稳定分析的几何非线性欧拉稳定理论

目前,桁架结构稳定分析有两个理论:经典的特征值理论和几何非线性临界点理论。前者发展较早,在许多结构力学书中都有叙述。但是经过工程应用检验,它过高地估计了结构抗稳定的能力。后者是20年前提出的,提出者认为适用于所有的扁桁架。经过几年的研究,作者连续提出三个稳定理论:线性与非线性欧拉理论;非线性临界点-欧拉理论和两个计算方法,进行桁架结构的线性和非线性截面优化设计。经过理论研究和对前人文献中数值例题的计算和比较,发现特征值理论不符合实际,临界点理论只适用于大扁度的桁架,而不适用于一切扁桁架。研究结果提供了若干有用的结论,给出了各种稳定理论的适用范围,指出了国际文献中若干例题的正确和错误,补充了桁架结构的稳定分析理论,使之更为完整和实用了。     

Computation of Entropy Production in Stratified Flames Based on Chemistry Tabulation and an Eulerian Transported Probability Density Function Approach

This contribution presents a straightforward strategy to investigate the entropy production in stratified premixed flames. The modeling approach is grounded on a chemistry tabulation strategy, large eddy simulation, and the Eulerian stochastic field method. This enables a combination of a detailed representation of the chemistry with an advanced model for the turbulence chemistry interaction, which is crucial to compute the various sources of exergy losses in combustion systems. First, using detailed reaction kinetic reference simulations in a simplified laminar stratified premixed flame, it is demonstrated that the tabulated chemistry is a suitable approach to compute the various sources of irreversibilities. Thereafter, the effects of the operating conditions on the entropy production are investigated. For this purpose, two operating conditions of the Darmstadt stratified burner with varying levels of shear have been considered. The investigations reveal that the contribution to the entropy production through mixing emerging from the chemical reaction is much larger than the one caused by the stratification. Moreover, it is shown that a stronger shear, realized through a larger Reynolds number, yields higher entropy production through heat, mixing and viscous dissipation and reduces the share by chemical reaction to the total entropy generated.