Determination of enthalpies of formation of organic free radicals from bond dissociation energies

The values of C−H and C−I bond dissociation energies were used to calculate the enthalpies of formation (δH _f ^o of 20 cyclic and conjugated hydrocarbon radicals (R′). The values of δH _f ^o (R′) were analyzed in terms of the quantitative structure-property correlation based on the additive-group model, and the reliability of these data was shown. Based on the correlation, several strain energies of cycles and energies of conjugation of a lone electron with a ρ-system were calculated. The additive-group method for calculation of δH _f ^o can be extended for radicals of the naphthalyl type. For Part 2, see Ref. 1. Translated fromIzvestiya Akademii Nauk. Seriya Khimicheskaya, No. 2, pp. 286–288, February, 1999.     

Rainbow hamilton cycles in random graphs

One of the most famous results in the theory of random graphs establishes that the threshold for Hamiltonicity in the Erd?s‐Rényi random graph G_n,p is around . Much research has been done to extend this to increasingly challenging random structures. In particular, a recent result by Frieze determined the asymptotic threshold for a loose Hamilton cycle in the random 3‐uniform hypergraph by connecting 3‐uniform hypergraphs to edge‐colored graphs. In this work, we consider that setting of edge‐colored graphs, and prove a result which achieves the best possible first order constant. Specifically, when the edges of G_n,p are randomly colored from a set of (1 + o(1))n colors, with , we show that one can almost always find a Hamilton cycle which has the additional property that all edges are distinctly colored (rainbow).Copyright © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 44, 328‐354, 2014     

Limit cycles of polynomial differential systems with homogeneous nonlinearities of degree 4 via the averaging method

By using the averaging method, we study the limit cycles for a class of quartic polynomial differential systems as well as their global shape in the plane. More specifically, we analyze the global shape of limit cycles bifurcating from a Hopf bifurcation and also from periodic orbits with linear center , . The perturbation of these systems is made inside the class of quartic polynomial differential systems without quadratic and cubic terms.     

On the girth of extremal graphs without shortest cycles

Let EX(ν;{C₃,…,C_n}) denote the set of graphs G of order ν that contain no cycles of length less than or equal to n which have maximum number of edges. In this paper we consider a problem posed by several authors: does G contain an n+1 cycle? We prove that the diameter of G is at most n−1, and present several results concerning the above question: the girth of G is g=n+1 if (i) ν≥n+5, diameter equal to n−1 and minimum degree at least 3; (ii) ν≥12, ν∉{15,80,170} and n=6. Moreover, if ν=15 we find an extremal graph of girth 8 obtained from a 3-regular complete bipartite graph subdividing its edges. (iii) We prove that if ν≥2n−3 and n≥7 the girth is at most 2n−5. We also show that the answer to the question is negative for ν≤n+1+⌊(n−2)/2⌋.     

All 2-connected in-tournaments that are cycle complementary

An in-tournament is an oriented graph such that the negative neighborhood of every vertex induces a tournament. A digraph D is cycle complementary if there exist two vertex-disjoint directed cycles spanning the vertex set of D. Let D be a 2-connected in-tournament of order at least 8. In this paper we show that D is not cycle complementary if and only if it is 2-regular and has odd order.     

A note on optimality conditions for the Euclidean. Multifacility location problem

Thekey problem of the Euclidean multifacility location (EMFL) problem is to decide whether a givendead point is optimal. If it is not optimal, we wish to compute a descent direction. This paper extends the optimality conditions of Calamai and Conn and Overton to the case when the rows of the active constraints matrix are linearly dependent. We show that linear dependence occurs wheneverG, the graph of the coinciding facilities, has a cycle. In this case the key problem is formulated as a linear least squares problem with bounds on the Euclidean norms of certain subvectors.     

完全r部图Kr（t）的{=C3，C2k}-强制分解（k≥4）的渐近存在性

研究基于顶点集V=Ui=1^rVi（其中｜Vi｜=t，i=1，2，……，r）的完全r部图Kr（t）的3圈和2k圈{C3，C2k}-强制分解（k≥4）的存在性问题．通过构造并运用Kr（t）的两种分解法，证明了Kr（t）的〈C3，C2k}-强制分解（k≥4）的渐近存在性，即对于任意给定的正整数k≥4，存在常数r0（k）=5k＋2，使得当r≥r0（k）时，Kr（t）的{C3，C2k}-强制分解存在的必要条件也是充分的．     

有向图n·■_m的优美性

给定有向图D(V,E),如果存在一个单射f:V(D)→{0,1,…,|E|}使得对于每条有向边(u,v),诱导函数f′:E(D)→{1,2,…,|E|}是一个双射函数,其中,f′(u,v)=[f(v)-f(u)](mod(|E|+1)),则f称为有向图D(V,E)的优美标号,f′称为有向图D(V,E)的诱导的边的优美标号.本文讨论了有向图n.■m的优美性,并且证明了当m=23且n为偶数时,n.■m是优美有向图.     

Terror and Counterterror Operations: Differential Game with Cyclical Nash Solution

The purpose of this paper is to study efficient measures to combat terror. To choose efficient actions against terror organizations, the response of terrorists has to be taken into consideration. Thus, an appropriate framework to study the intertemporal strategic interactions of Western governments and terror organizations is dynamic game theory. Using the open-loop Nash solution concept, it turns out that the system may exhibit long-run persistent oscillations. However, transitory behavior is nonunique.     

Periodic solutions for planar autonomous systems with nonsmooth periodic perturbations

In this paper we consider a class of planar autonomous systems having an isolated limit cycle x₀ of smallest period T>0 such that the associated linearized system around it has only one characteristic multiplier with absolute value 1. We consider two functions, defined by means of the eigenfunctions of the adjoint of the linearized system, and we formulate conditions in terms of them in order to have the existence of two geometrically distinct families of T-periodic solutions of the autonomous system when it is perturbed by nonsmooth T-periodic nonlinear terms of small amplitude. We also show the convergence of these periodic solutions to x₀ as the perturbation disappears and we provide an estimation of the rate of convergence. The employed methods are mainly based on the theory of topological degree and its properties that allow less regularity on the data than that required by the approach, commonly employed in the existing literature on this subject, based on various versions of the implicit function theorem.