Advanced Search

This paper is concerned with the finite-time synchronization problem for a class of cross-strict feedback underactuated hyperchaotic systems. Using finite-time control and backstepping control approaches, a new robust adaptive synchronization scheme is proposed to make the synchronization errors of the systems with parameter uncertainties zero in a finite time. Appropriate adaptive laws are derived to deal with the unknown parameters of the systems. The proposed method can be applied to a variety...

Let $K_{s,t}$ be the complete bipartite graph with partite sets $\{x_1,...,x_s\}$ and $\{y_1,...,y_t\}$. A split bipartite-graph on $(s+s^{\text{'}})+(t+t^{\text{'}})$ vertices, denoted by ${\mathrm{SB}}_{s+s^{\text{'}},t+t^{\text{'}}}$, is the graph obtained from $K_{s,t}$ by adding $s^{\text{'}}+t^{\text{'}}$ new vertices $x_{s+1},...,x_{s+s^{\text{'}}}$, $y_{t+1},...,y_{t+t^{\text{'}}}$ such that each of $x_{s+1},...,x_{s+s^{\text{'}}}$ is adjacent to each of $y_1,...,y_t$ and each of $y_{t+1},...,y_{t+t^{\text{'}}}$ is adjacent to each of $x_1,...,x_s$. Let $A$ and $B$ be nonincreasing lists of nonnegative integers, having lengths $m$ and $n$, respectively. The pair $(A;B)$ is potentially ${\mathrm{SB}}_{s+s^{\text{'}},t+t^{\text{'}}}$-bigraphic if there is a simple bipartite graph containing ${\mathrm{SB}}_{s+s^{\text{'}},t+t^{\text{'}}}$ (with $s+s^{\text{'}}$ vertices $x_1,...,x_{s+s^{\text{'}}}$ in the part of size $m$ and $t+t^{\text{'}}$ vertices...