Determination of the prime bound of a graph

Given a graph $G$, a subset $M$ of $V(G)$ is a module of $G$ if for each $v\in V(G)\setminus M$, $v$ is adjacent to all the elements of $M$ or to none of them. For instance, $V(G)$, $\emptyset$ and $\{v\}$ ($v\in V(G)$) are modules of $G$ called trivial. Given a graph $G$, $\omega_M(G)$ (respectively $\alpha_M(G)$) denotes the largest integer $m$ such that there is a module $M$ of $G$ which is a clique (respectively a stable) set in $G$ with $|M|=m$. A graph $G$ is prime if $|V(G)|\geq 4$ and if all its modules are trivial. The prime bound of $G$ is the smallest integer $p(G)$ such that there is a prime graph $H$ with $V(H)\supseteq V(G)$, $H[V(G)]=G$ and $|V(H)\setminus V(G)|=p(G)$. We establish the following. For every graph $G$ such that $\max(\alpha_M(G),\omega_M(G))\geq 2$ and $\log_2(\max(\alpha_M(G),\omega_M(G)))$ is not an integer, $p(G)=\lceil\log_2(\max(\alpha_M(G),\omega_M(G)))\rceil$. Then, we prove that for every graph $G$ such that $\max(\alpha_M(G),\omega_M(G))=2^k$ where $k\geq 1$, $p(G)=k$ or $k+1$. Moreover $p(G)=k+1$ if and only if $G$ or its complement admits $2^k$ isolated vertices. Lastly, we show that $p(G)=1$ for every non prime graph $G$ such that $|V(G)|\geq 4$ and $\alpha_M(G)=\omega_M(G)=1$.Comment: arXiv admin note: text overlap with arXiv:1110.293

Feedback Control of Nonlinear Dissipative Systems by Finite Determining Parameters - A Reaction-diffusion Paradigm

We introduce here a simple finite-dimensional feedback control scheme for stabilizing solutions of infinite-dimensional dissipative evolution equations, such as reaction-diffusion systems, the Navier-Stokes equations and the Kuramoto-Sivashinsky equation. The designed feedback control scheme takes advantage of the fact that such systems possess finite number of determining parameters (degrees of freedom), namely, finite number of determining Fourier modes, determining nodes, and determining interpolants and projections. In particular, the feedback control scheme uses finitely many of such observables and controllers. This observation is of a particular interest since it implies that our approach has far more reaching applications, in particular, in data assimilation. Moreover, we emphasize that our scheme treats all kinds of the determining projections, as well as, the various dissipative equations with one unified approach. However, for the sake of simplicity we demonstrate our approach in this paper to a one-dimensional reaction-diffusion equation paradigm