Transgression on hyperkähler manifolds and generalized higher torsion forms

We propose a generalization of the Hodge dd_c-lemma to the case of hyperk?hler manifolds. As an application we derive a global construction of the fourth order transgression of the Chern character forms of hyperholomorphic bundles over compact hyperk?hler manifolds. In Section 3 we consider the fourth order transgression for the infinite-dimensional bundle arising from local families of hyperk?hler manifolds. We propose a local construction of the fourth order transgression of the Chern character form. We derive an explicit expression for the arising hypertorsion differential form. Its zero-degree part may be expressed in terms of the Laplace operators defined on the fibres of the local family.     

On the extremal Merrifield-Simmons index and Hosoya index of quasi-tree graphs

It is well known that the two graph invariants, “the Merrifield-Simmons index” and “the Hosoya index” are important in structural chemistry. A graph G is called a quasi-tree graph, if there exists u₀ in V(G) such that G−u₀ is a tree. In this paper, at first we characterize the n-vertex quasi-tree graphs with the largest, the second-largest, the smallest and the second-smallest Merrifield-Simmons indices. Then we characterize the n-vertex quasi-tree graphs with the largest, the second-largest, the smallest and the second-smallest Hosoya indices, as well as those n-vertex quasi-tree graphs with k pendent vertices having the smallest Hosoya index.     

On the index of caterpillars

The index of a graph is the largest eigenvalue of its adjacency matrix. Among the trees with a fixed order and diameter, a graph with the maximal index is a caterpillar. In the set of caterpillars with a fixed order and diameter, or with a fixed degree sequence, we identify those whose index is maximal.     

Estimating the Estrada index

Let G be a graph on n vertices, and let λ₁,λ₂,…,λ_n be its eigenvalues. The Estrada index of G is a recently introduced graph invariant, defined as . We establish lower and upper bounds for EE in terms of the number of vertices and number of edges. Also some inequalities between EE and the energy of G are obtained.     

Estimating the Szeged index

Lower and upper bounds on Szeged index of connected (molecular) graphs are established as well as Nordhaus–Gaddum-type results, relating the Szeged index of a graph and of its complement.     

On the maslov index

In this paper we give four definitions of Maslov index and show that they all satisfy the same system of axioms and hence are equivalent to each other. Moreover, relationships of several symplectic and differential geometric, analytic, and topological invariants (including triple Maslov indices, eta invariants, spectral flow and signatures of quadratic forms) to the Maslov index are developed and formulae relating them are given. The broad presentation is designed with a view to applications both in geometry and in analysis. © 1994 John Wiley & Sons, Inc.     

Use of the Szeged index and the revised Szeged index for measuring network bipartivity

We have revisited the Szeged index (Sz) and the revised Szeged index (Sz^∗), both of which represent a generalization of the Wiener number to cyclic structures. Unexpectedly we found that the quotient of the two indices offers a novel measure for characterization of the degree of bipartivity of networks, that is, offers a measure of the departure of a network, or a graph, from bipartite networks or bipartite graphs, respectively. This is because the two indices assume the same values for bipartite graphs and different values for non-bipartite graphs. We have proposed therefore the quotient Sz/Sz^∗ as a measure of bipartivity. In this note we report on some properties of the revised Szeged index and the quotient Sz/Sz^∗ illustrated on a number of smaller graphs as models of networks.     

Likelihood estimation of the extremal index

The article develops the approach of Ferro and Segers (J.R. Stat. Soc., Ser. B 65:545, 2003) to the estimation of the extremal index, and proposes the use of a new variable decreasing the bias of the likelihood based on the point process character of the exceedances. Two estimators are discussed: a maximum likelihood estimator and an iterative least squares estimator based on the normalized gaps between clusters. The first provides a flexible tool for use with smoothing methods. A diagnostic is given for condition , under which maximum likelihood is valid. The performance of the new estimators were tested by extensive simulations. An application to the Central England temperature series demonstrates the use of the maximum likelihood estimator together with smoothing methods.      

Geodesics of the Structural Similarity index

We construct metrics from the geodesics of the Structural Similarity index, an image quality assessment measure. An analytical solution is given for the simple case of zero stability constants, and the general solution involving the numerical solution of a nonlinear equation is also found.     

On the Hosoya index of graphs

Let G be a (molecular) graph. The Hosoya index Z(G) of G is defined as the number of subsets of the edge set E(G) in which no two edges are adjacent in G, i.e., Z(G) is the total number of matchings of G. In this paper, we determine all the connected graphs G with n + 1 ≤ Z(G) ≤ 5n ? 17 for n ≥ 19. As a byproduct, the graphs of n vertices with Hosoya index from the second smallest value to the twenty first smallest value are obtained for n ≥ 19.     

An analogue of the Maslov index

An analogue of the Maslov index is constructed for an n-dimensional oriented totally real submanifold of a quasicomplex 2n-manifold with the first Chern class vanishing modulo k. Relationships with the familiar invariants are considered in special cases. Bibliography: 10 titles. Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 208, 1993, pp. 133–135. Translated by N. Yu. Netsvetaev.