Algebraic Connectivity and Disjoint Vertex Subsets of Graphs

It is well known that the algebraic connectivity of a graph is the second small eigenvalue of its Laplacian matrix. In this paper, we mainly research the relationships between the algebraic connectivity and the disjoint vertex subsets of graphs, which are presented through some upper bounds on algebraic connectivity.

Infinite Kirchhoff plate on a compact elastic foundation may have arbitrary small eigenvalue

An inhomogeneous Kirhhoff plate composed from semi-infinite strip-waveguide and a compaсt resonator which is in contact with the Winkler foundation of small compliance, is considered. It is shown that for any 0, it is possible to find the compliance coefficient O(2) such that the described plate possesses the eigenvalue 4embedded into continuous spectrum. This result is quite surprising because in an acoustic waveguide (the spectral Neumann problem for the Laplace operator) a small eigenvalue does not exist for any unsubstantial perturbation. A reason of this dissension is explained as well.

Numerical Approximations to Extremal Toric Kähler Metrics with Arbitrary Kähler Class

We develop new algorithms for approximating extremal toric Kähler metrics. We focus on an extremal metric on , which is conformal to an Einstein metric (the Chen–LeBrun–Weber metric). We compare our approximation to one given by Bunch and Donaldson and compute various geometric quantities. In particular, we demonstrate a small eigenvalue of the scalar Laplacian of the Einstein metric that gives numerical evidence that the Einstein metric is conformally unstable under Ricci flow.

Distance-Regular Graphs with a Relatively Small Eigenvalue Multiplicity

Godsil showed that if $\Gamma$ is a distance-regular graph with diameter $D \geq 3$ and valency $k \geq 3$, and $\theta$ is an eigenvalue of $\Gamma$ with multiplicity $m \geq 2$, then $k \leq\frac{(m+2)(m-1)}{2}$.In this paper we will give a refined statement of this result. We show that if $\Gamma$ is a distance-regular graph with diameter $D \geq 3$, valency $k \geq 2$ and an eigenvalue $\theta$ with multiplicity $m\geq 2$, such that $k$ is close to $\frac{(m+2)(m-1)}{2}$, then $\theta$ must be a tail. We also characterize the distance-regular graphs with diameter $D \geq 3$, valency $k \geq 3$ and an eigenvalue $\theta$ with multiplicity $m \geq 2$ satisfying $k= \frac{(m+2)(m-1)}{2}$.