Some new results involving general standby systems

This article presents a stochastic comparison on the total lifetime of the general standby system and a discussion of the optimal allocation of a general standby component in a series system with two independent components. Several examples are also presented to justify the main results, which provide nice generalizations of some existing conclusions in the literature. Copyright © 2009 John Wiley & Sons, Ltd.     

Some inequalities for the atom-bond connectivity index of graph operations

The atom-bond connectivity index is a useful topological index in studying the stability of alkanes and the strain energy of cycloalkanes. In this paper some inequalities for the atom-bond connectivity index of a series of graph operations are presented. We also prove our bounds are tight. As an application, the ABC indices of C₄ nanotubes and nanotori are computed.     

An upper bound on the independence number of benzenoid systems

Recently, the graph theoretic independence number has been linked to fullerene stability [S. Fajtlowicz, C. Larson, Graph-theoretic independence as a predictor of fullerene stability, Chem. Phys. Lett. 377 (2003) 485-490; S. Fajtlowicz, Fullerene Expanders, A list of Conjectures of Minuteman, Available from S. Fajtlowicz: math0@bayou.uh.edu]. In particular, stable fullerenes seem to minimize their independence numbers. A large piece of evidence for this hypothesis comes from the fact that stable benzenoids—close relatives of fullerenes—do minimize their independence numbers [S. Fajtlowicz, “Pony Express”—Graffiti's conjectures about carcinogenic and stable benzenoids, 〈http://www.math.uh.edu/∼siemion/pony.html〉]. In this paper, an upper bound on the independence number of benzenoids is introduced and proven—giving a limit on how large the independence ratio for benzenoids can be. In conclusion, this bound on independence is correlated to an upper bound on the number of unpaired sites a benzenoid system has with respect to a maximum matching, which is precisely the number of zero eigenvalues in the spectrum of the adjacency matrix (due to a conjecture of Graffiti and its proof by Sachs [S. Fajtlowicz, “Pony Express”—Graffiti's conjectures about carcinogenic and stable benzenoids, 〈http://www.math.uh.edu/∼siemion/pony.html〉; H. Sachs, P. John, S. Fajtlowicz, On Maximum Matchings and Eigenvalues of Benzenoid Graphs, preprint—MATCH]). Thus, since zero eigenvalues and unpaired sites are indicative of instability (reactivity), we get a simple but intuitive bound on how reactive a benzenoid molecule can be.     

Some particular properties of general orthonormal systems

Periodica Mathematica Hungarica - The present paper deals with some particular properties of special series of Fourier coefficients of the class of functions with bounded variation with respect to...     

Convergence of general linear methods on differential-algebraic systems of index 3

Many numerical methods used to solve ordinary differential equations or differential-algebraic equations can be written as general linear methods. The purpose of this paper is to extend the known convergence results for Runge-Kutta and linear multistep methods to a large class of new promising numerical schemes. The theoretical results are illustrated by some numerical experiments.     

Diophantine properties of IETs and general systems: quantitative proximality and connectivity

Three properties of dynamical systems (recurrence, connectivity and proximality) are quantified by introducing and studying the gauges (measurable functions) corresponding to each of these properties. The properties of the proximality gauge are related to the results in the active field of shrinking targets. The emphasis in the present paper is on the IETs (interval exchange transformations) $( \mathcal {I},T)$ , $\mathcal {I}=[0,1)$ . In particular, we prove that if an IET T is ergodic (relative to the Lebesgue measure λ), then the equality A1 $$ \liminf_{n\to\infty} \, n\, \bigl|T^n(x)-y \bigr|=0 $$ holds for λ×λ-a.a. $(x,y)\in \mathcal {I}^{2}$ . The ergodicity assumption is essential: the result does not extend to all minimal IETs. Also, the factor? n? in (A1) is optimal (e.g., it cannot be replaced by n?ln(ln(lnn))). On the other hand, for Lebesgue almost all 3-IETs $( \mathcal {I},T)$ we prove that for all ?>0 A2 $$ \liminf_{n\to\infty} \, n^ \epsilon \bigl |T^n(x)-T^n(y)\bigr| = \infty,\quad\text{for Lebesgue a.a.} \ (x,y)\in \mathcal {I}^2. $$ This should be contrasted with the equality lim?inf _n→∞?|T ⁿ (x)?T ⁿ (y)|=0, for a.a. $(x,y)\in \mathcal {I}^{2}$ , which holds since $( \mathcal {I}^{2}, T\times T)$ is ergodic (because generic 3-IETs $( \mathcal {I},T)$ are weakly mixing). We introduce the notion of τ-entropy of an IET which is related to obtaining estimates of type (A2). We also prove that no 3-IET is strongly topologically mixing.     

Some general considerations concerning the destabilizing effect in nonconservative systems

Zusammenfassung Es wird ein lineares System mitN Freiheitsgraden untersucht, beansprucht durch eine Gruppe nichtkonservativer Kräfte, welche linear von den verallgemeinerten Koordinaten abhängen. Mehrere Sätze bezüglich die labilisierende Wirkung von kleinen Kräften, die von den verallgemeinerten Geschwindigkeiten abhängen, werden aufgestellt. Diese Kräfte können von der Dämpfung oder von gyroskopischen Einflüssen herrühren.

---

---

This research was supported by the National Aeronautics and Space Administration under Grant NsG 605.     

Atom-bond connectivity index of graphs

The recently introduced atom-bond connectivity (ABC) index has been applied up until now to study the stability of alkanes and the strain energy of cycloalkanes. Furtula et al. (2009) [3] obtained extremal ABC values for chemical trees, and also, it has been shown that the star K_1,n−1, has the maximal ABC value of trees. In this paper, we present the lower and upper bounds on ABC index of graphs and trees, and characterize graphs for which these bounds are best possible.     

Trees of extremal connectivity index

The connectivity index w_α(G) of a graph G is the sum of the weights (d(u)d(v))^α of all edges uv of G, where α is a real number (α≠0), and d(u) denotes the degree of the vertex u. Let T be a tree with n vertices and k pendant vertices. In this paper, we give sharp lower and upper bounds for w₁(T). Also, for -1?α<0, we give a sharp lower bound and a upper bound for w_α(T).     

Atom-bond connectivity index of trees

The recently introduced atom-bond connectivity (ABC) index has been applied up to now to study the stability of alkanes and the strain energy of cycloalkanes. Here, mathematical properties of the ABC index of trees are studied. Chemical trees with extremal ABC values are found. In addition, it has been proven that, among all trees, the star tree, S_n, has the maximal ABC value.     

Some new perfect Steiner triple systems

In a Steiner triple system STS(v) = (V, B), for each pair {a, b} ⊂ V, the cycle graph G_a,b can be defined as follows. The vertices of G_a,b are V \ {a, b, c} where {a, b, c} ∈ B. {x, y} is an edge if either {a, x, y} or {b, x, y} ∈ B. The Steiner triple system is said to be perfect if the cycle graph of every pair is a single (v − 3)-cycle. Perfect STS(v) are known only for v = 7, 9, 25, and 33. We construct perfect STS (v) for v = 79, 139, 367, 811, 1531, 25771, 50923, 61339, and 69991. © 1999 John Wiley & Sons, Inc. J Combin Designs 7: 327–330, 1999     

Further results on atom-bond connectivity index of trees

The atom-bond connectivity (ABC) index of a graph G is defined as

     

On the eccentric connectivity index of a graph

If G is a connected graph with vertex set V, then the eccentric connectivity index of G, ξ^C(G), is defined as where is the degree of a vertex v and is its eccentricity. We obtain an exact lower bound on ξ^C(G) in terms of order, and show that this bound is sharp. An asymptotically sharp upper bound is also derived. In addition, for trees of given order, when the diameter is also prescribed, precise upper and lower bounds are provided.     

Some new 2-resolvable Steiner quadruple systems

Zaicev, Zinoviev and Semakov [12] and, independently, Baker [1], constructed 2-resolvableS(3, 4, 4 ⁿ ) for all . However, no 2-resolvableS(3, 4,v),v4, were known for any other value ofv. In this paper, we construct infinite classes of 2-resolvableS(3, 4,v) for values ofv that are not a power of 4. In particular, we construct a 2-resolvableS(3, 4, 100).Research supported by NSF grant DMS-9123727.     

On distance local connectivity and the hamiltonian index

In this paper we introduce the concept of distance local connectivity of a graph. We give several sufficient conditions in terms of the independence number and of the vertex degrees, and we show a relation between the distance local connectivity and the hamiltonian index of a graph.