A note on dominating cycles in 2-connected graphs

Let G be a 2-connected graph on n vertices such that d(x) + d(y) + d(z) n for all triples of independent vertices x, y, z. We prove that every longest cycle in G is a dominating cycle unless G is a spanning subgraph of a graph belonging to one of four easily specified classes of graphs

Long cycles in graphs containing a 2-factor with many odd components

We prove a result on the length of a longest cycle in a graph on n vertices that contains a 2-factor and satisfies d(u)+d(c)+d(w)n+2 for every tiple u, v, w of independent vertices. As a corollary we obtain the follwing improvement of a conjectre of Häggkvist (1992): Let G be a 2-connected graph on n vertices where every pair of nonadjacent vertices has degree sum at least n-k and assume G has a 2-factor with at least k+1 odd components. Then G is hamiltonian

Explicit schemes for time propagating many-body wavefunctions

Accurate theoretical data on many time-dependent processes in atomic and molecular physics and in chemistry require the direct numerical solution of the time-dependent Schr\"odinger equation, thereby motivating the development of very efficient time propagators. These usually involve the solution of very large systems of first order differential equations that are characterized by a high degree of stiffness. We analyze and compare the performance of the explicit one-step algorithms of Fatunla and Arnoldi. Both algorithms have exactly the same stability function, therefore sharing the same stability properties that turn out to be optimum. Their respective accuracy however differs significantly and depends on the physical situation involved. In order to test this accuracy, we use a predictor-corrector scheme in which the predictor is either Fatunla's or Arnoldi's algorithm and the corrector, a fully implicit four-stage Radau IIA method of order 7. We consider two physical processes. The first one is the ionization of an atomic system by a short and intense electromagnetic pulse; the atomic systems include a one-dimensional Gaussian model potential as well as atomic hydrogen and helium, both in full dimensionality. The second process is the decoherence of two-electron quantum states when a time independent perturbation is applied to a planar two-electron quantum dot where both electrons are confined in an anharmonic potential. Even though the Hamiltonian of this system is time independent the corresponding differential equation shows a striking stiffness. For the one-dimensional Gaussian potential we discuss in detail the possibility of monitoring the time step for both explicit algorithms. In the other physical situations that are much more demanding in term of computations, we show that the accuracy of both algorithms depends strongly on the degree of stiffness of the problem.Comment: 24 pages, 14 Figure

Long cycles, degree sums and neighborhood unions

AbstractFor a graph G, define the parameters α(G)=max{|S| |S is an independent set of vertices of G}, σk(G)=min{∑ki=1d(vi)|{v1,…,vk} is an independent set} and NCk(G)= min{|∪ki=1 N(vi)∥{v1,…,vk} is an independent set} (k⩾2). It is shown that every 1-tough graph G of order n⩾3 with σ3(G)⩾n+r⩾n has a cycle of length at least min{n,n+NCr+5+∈(n+r)(G)-α(G)}, where ε(i)=3(⌈13i⌉−13i). This result extends previous results in Bauer et al. (1989/90), Faßbender (1992) and Flandrin et al. (1991). It is also shown that a 1-tough graph G of order n⩾3 with σ3(G)⩾n+r⩾n has a cycle of length at least min{n,2NC⌊18(n+6r+17)⌋(G)}. Analogous results are established for 2-connected graphs

Embedding large subgraphs into dense graphs

What conditions ensure that a graph G contains some given spanning subgraph H? The most famous examples of results of this kind are probably Dirac's theorem on Hamilton cycles and Tutte's theorem on perfect matchings. Perfect matchings are generalized by perfect F-packings, where instead of covering all the vertices of G by disjoint edges, we want to cover G by disjoint copies of a (small) graph F. It is unlikely that there is a characterization of all graphs G which contain a perfect F-packing, so as in the case of Dirac's theorem it makes sense to study conditions on the minimum degree of G which guarantee a perfect F-packing. The Regularity lemma of Szemeredi and the Blow-up lemma of Komlos, Sarkozy and Szemeredi have proved to be powerful tools in attacking such problems and quite recently, several long-standing problems and conjectures in the area have been solved using these. In this survey, we give an outline of recent progress (with our main emphasis on F-packings, Hamiltonicity problems and tree embeddings) and describe some of the methods involved