The domination number and the least QQ-eigenvalue

A vertex set $D$ of a graph $G$ is said to be a dominating set if every vertex of $V(G)\setminus D$ is adjacent to at least a vertex in $D$, and the domination number $\gamma(G)$ ($\gamma$, for short) is the minimum cardinality of all dominating sets of $G$. For a graph, the least $Q$-eigenvalue is the least eigenvalue of its signless Laplacian matrix. In this paper, for a nonbipartite graph with both order $n$ and domination number $\gamma$, we show that $n\geq 3\gamma-1$, and show that it contains a unicyclic spanning subgraph with the same domination number $\gamma$. By investigating the relation between the domination number and the least $Q$-eigenvalue of a graph, we minimize the least $Q$-eigenvalue among all the nonbipartite graphs with given domination number.Comment: 13 pages, 3 figure

Stochastic Averaging Principle for Dynamical Systems with Fractional Brownian Motion

Stochastic averaging for a class of stochastic differential equations (SDEs) with fractional Brownian motion, of the Hurst parameter H in the interval (1/2, 1), is investigated. An averaged SDE for the original SDE is proposed, and their solutions are quantitatively compared. It is shown that the solution of the averaged SDE converges to that of the original SDE in the sense of mean square and also in probability. It is further demonstrated that a similar averaging principle holds for SDEs under stochastic integral of pathwise backward and forward types. Two examples are presented and numerical simulations are carried out to illustrate the averaging principle