Let G(n; m) be a connected graph without loops and multiple edges which has n vertices and m edges. We ÿnd the graphs on which the zeroth-order connectivity index, equal to the sum of degrees of vertices of G(n; m) raised to the power − 1 2 , attains maximum.

Abstract We study Hessian estimators for functions defined over an $n$-dimensional complete analytic Riemannian manifold. introduce new stochastic zeroth-order using $O (1)$ function evaluations. show that, real-valued $f$, our estimator achieves a bias bound of order $ O ( \gamma \delta ^2 ) $, where depends on both the Levi–Civita connection and $\delta is finite difference step size. To best...

Basic theoretical treatments of quantum beats are presented using the effective Hamiltonian method and the density matrix method. To describe the states involved in quantum beats, the molecular-eigen state basis set and the zeroth order basis set are introduced. Based on these basis sets for the two-state model, the condition under which molecular coherence can be created is discussed.