On cubic non‐Cayley vertex‐transitive graphs

In 1983, the second author [D. Maru?i?, Ars Combinatoria 16B (1983), 297–302] asked for which positive integers n there exists a non‐Cayley vertex‐transitive graph on n vertices. (The term non‐Cayley numbers has later been given to such integers.) Motivated by this problem, Feng [Discrete Math 248 (2002), 265–269] asked to determine the smallest valency ?(n) among valencies of non‐Cayley vertex‐transitive graphs of order n. As cycles are clearly Cayley graphs, ?(n)?3 for any non‐Cayley number n. In this paper a goal is set to determine those non‐Cayley numbers n for which ?(n) = 3, and among the latter to determine those for which the generalized Petersen graphs are the only non‐Cayley vertex‐transitive graphs of order n. It is known that for a prime p every vertex‐transitive graph of order p, p² or p³ is a Cayley graph, and that, with the exception of the Coxeter graph, every cubic non‐Cayley vertex‐transitive graph of order 2p, 4p or 2p² is a generalized Petersen graph. In this paper the next natural step is taken by proving that every cubic non‐Cayley vertex‐transitive graph of order 4p², p>7 a prime, is a generalized Petersen graph. In addition, cubic non‐Cayley vertex‐transitive graphs of order 2p^k, where p>7 is a prime and k?p, are characterized. © 2011 Wiley Periodicals, Inc. J Graph Theory 69: 77–95, 2012     

The spin-isospin decomposition of the nuclear symmetry energy from low to high density

The energy per particle BA in nuclear matter is calculated up to high baryon density in the whole isospin asymmetry range from symmetric matter to pure neutron matter.The results,obtained in the framework of the Brueckner-Hartree-Fock approximation with two-and three-body forces,confirm the well-known parabolic dependence on the asymmetry parameterβ=(N?Z)/A(β^2 law)that is valid in a wide density range.To investigate the extent to which this behavior can be traced back to the properties of the underlying interaction,aside from the mean field approximation,the spin-isospin decomposition of BA is performed.Theoretical indications suggest that theβ^2 law could be violated at higher densities as a consequence of the three-body forces.This raises the problem that the symmetry energy,calculated according to theβ^2 law as a difference between BA in pure neutron matter and symmetric nuclear matter,cannot be applied to neutron stars.One should return to the proper definition of the nuclear symmetry energy as a response of the nuclear system to small isospin imbalance from the Z=N nuclei and pure neutron matter.     

Intriguing sets in partial quadrangles

The point‐line geometry known as a partial quadrangle (introduced by Cameron in 1975) has the property that for every point/line non‐incident pair (P, ?), there is at most one line through P concurrent with ?. So in particular, the well‐studied objects known as generalized quadrangles are each partial quadrangles. An intriguing set of a generalized quadrangle is a set of points which induces an equitable partition of size two of the underlying strongly regular graph. We extend the theory of intriguing sets of generalized quadrangles by Bamberg, Law and Penttila to partial quadrangles, which gives insight into the structure of hemisystems and other intriguing sets of generalized quadrangles. © 2010 Wiley Periodicals, Inc. J Combin Designs 19:217‐245, 2011     

On planar hypohamiltonian graphs

We present a planar hypohamiltonian graph on 42 vertices and (as a corollary) a planar hypotraceable graph on 162 vertices, improving the bounds of Zamfirescu and Zamfirescu and show some other consequences. We also settle the open problem whether there exists a positive integer N, such that for every integer n≥N there exists a planar hypohamiltonian/hypotraceable graph on n vertices. © 2010 Wiley Periodicals, Inc. J Graph Theory 67: 55‐68, 2011     

The existence of a 2‐factor in K1, n‐free graphs with large connectivity and large edge‐connectivity

In this article, we study the existence of a 2‐factor in a K_{1, n}‐free graph. Sumner [J London Math Soc 13 (1976), 351–359] proved that for n?4, an (n?1)‐connected K_{1, n}‐free graph of even order has a 1‐factor. On the other hand, for every pair of integers m and n with m?n?4, there exist infinitely many (n?2)‐connected K_{1, n}‐free graphs of even order and minimum degree at least m which have no 1‐factor. This implies that the connectivity condition of Sumner's result is sharp, and we cannot guarantee the existence of a 1‐factor by imposing a large minimum degree. On the other hand, Ota and Tokuda [J Graph Theory 22 (1996), 59–64] proved that for n?3, every K_{1, n}‐free graph of minimum degree at least 2n?2 has a 2‐factor, regardless of its connectivity. They also gave examples showing that their minimum degree condition is sharp. But all of them have bridges. These suggest that the effects of connectivity, edge‐connectivity and minimum degree to the existence of a 2‐factor in a K_{1, n}‐free graph are more complicated than those to the existence of a 1‐factor. In this article, we clarify these effects by giving sharp minimum degree conditions for a K_{1, n}‐free graph with a given connectivity or edge‐connectivity to have a 2‐factor. Copyright © 2010 Wiley Periodicals, Inc. J Graph Theory 68:77‐89, 2011     

Disjoint Hamilton cycles in the random geometric graph

We consider the standard random geometric graph process in which n vertices are placed at random on the unit square and edges are sequentially added in increasing order of edge‐length. For fixed k?1, weprove that the first edge in the process that creates a k‐connected graph coincides a.a.s. with the first edge that causes the graph to contain k/2 pairwise edge‐disjoint Hamilton cycles (for even k), or (k?1)/2 Hamilton cycles plus one perfect matching, all of them pairwise edge‐disjoint (for odd k). This proves and extends a conjecture of Krivelevich and M ler. In the special case when k = 2, our result says that the first edge that makes the random geometric graph Hamiltonian is a.a.s. exactly the same one that gives 2‐connectivity, which answers a question of Penrose. (This result appeared in three independent preprints, one of which was a precursor to this article.) We prove our results with lengths measured using the ?_p norm for any p>1, and we also extend our result to higher dimensions. © 2011 Wiley Periodicals, Inc. J Graph Theory 68:299‐322, 2011     

Parallel characteristic finite element method for time‐dependent convection–diffusion problem

Based on the overlapping‐domain decomposition and parallel subspace correction method, a new parallel algorithm is established for solving time‐dependent convection–diffusion problem with characteristic finite element scheme. The algorithm is fully parallel. We analyze the convergence of this algorithm, and study the dependence of the convergent rate on the spacial mesh size, time increment, iteration times and sub‐domains overlapping degree. Both theoretical analysis and numerical results suggest that only one or two iterations are needed to reach to optimal accuracy at each time step. Copyright © 2010 John Wiley & Sons, Ltd.     

An optimization‐based domain decomposition method for numerical simulation of the incompressible Navier‐Stokes flows

This article is concerned about an optimization‐based domain decomposition method for numerical simulation of the incompressible Navier‐Stokes flows. Using the method, an classical domain decomposition problem is transformed into a constrained minimization problem for which the objective functional is chosen to measure the jump in the dependent variables across the common interfaces between subdomains. The Lagrange multiplier rule is used to transform the constrained optimization problem into an unconstrained one and that rule is applied to derive an optimality system from which optimal solutions may be obtained. The optimality system is also derived using “sensitivity” derivatives instead of the Lagrange multiplier rule. We consider a gradient‐type approach to the solution of domain decomposition problem. The results of some numerical experiments are presented to demonstrate the feasibility and applicability of the algorithm developed in this article. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2011     

Inverse estimation of indoor airflow patterns using singular value decomposition

The fast pace in the development of indoor sensors and communication technologies is allowing a great amount of sensor data to be utilized in various areas of indoor air applications, such as estimating indoor airflow patterns. The development of such an inverse model and the design of a sensor system to collect appropriate data are discussed in this study. Algebraic approaches, including singular value decomposition (SVD), are evaluated as methods to inversely estimate airflow patterns given limited sensor measurements. In lieu of actual sensor data, computational fluid dynamics data are used to evaluate the accuracy of the airflow patterns estimated by the inverse models developed in this study. It was found that the airflow patterns estimated by the linear inverse SVD model were as accurate as those estimated by the nonlinear inverse-multizone model. For the zones tested, sensor measurements along on the walls and near the inlet and outlet provided the greatest improvement in the accuracy of the estimated airflow patterns when compared with the results using measurements from other locations.     

加权测度下Banach 格值鞅的原子分解

本文讨论加权情形下Banach 格值鞅的原子分解并借助于原子分解研究Banach 格值鞅空间的内插理论.