Related papers: Controllable Subsets in Graphs
We say that a control system is locally controllable if the attainable set from any state $x$ contains an open neighborhood of $x$, while it is controllable if the attainable set from any state is the entire state manifold. We show in this…
The duality between controllability and observability enables methods developed for full-state control to be applied to full-state estimation, and vice versa. In applications in which control or estimation of all state variables is…
A graph $G = (V, E)$ of bounded degree has an adjacency operator~$A$ which acts on the Hilbert space $\ell^2(V)$. There are different kinds of measures of interest on the spectrum $\Sigma (A)$ of $A$. In particular, each vector $\xi \in…
We investigate the controllability of an infinite-dimensional quantum system: a quantum particle confined on a Thick Quantum Graph, a generalisation of Quantum Graphs whose edges are allowed to be manifolds of arbitrary dimension with…
We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing…
This paper develops a structural theory of unique shortest paths in real-weighted graphs. Our main goal is to characterize exactly which sets of node sequences, which we call path systems, can be realized as unique shortest paths in a graph…
Let $X$ be a finite vertex-transitive graph of valency $d$, and let $A$ be the full automorphism group of $X$. Then the arc-type of $X$ is defined in terms of the sizes of the orbits of the action of the stabiliser $A_v$ of a given vertex…
In a coupled network cells can interact in several ways. There is a vast literature from the last twenty years that investigates this interacting dynamics under a graph theory formalism, namely as a graph endowed with an input-equivalence…
This paper provides a full controlled version of algebraic $K$-theory. This includes a rich array of assembly maps; the controlled assembly isomorphism theorem identifying the controlled group with homology; and the stability theorem…
In Two-Sets Cut-Uncut, we are given an undirected graph $G=(V,E)$ and two terminal sets $S$ and $T$. The task is to find a minimum cut $C$ in $G$ (if there is any) separating $S$ from $T$ under the following ``uncut'' condition. In the…
A pair of graphs $(\Gamma,\Sigma)$ is said to be stable if the full automorphism group of $\Gamma\times\Sigma$ is isomorphic to the product of the full automorphism groups of $\Gamma$ and $\Sigma$ and unstable otherwise, where…
Sun et al. provided an insightful comment arXiv:1108.5739v1 on our manuscript entitled "Controllability of Complex Networks with Nonlinear Dynamics" on arXiv. We agree on their main point that linearization about locally desired states can…
Let $G=(V,E)$ be a simple graph. A set $I\subseteq V$ is an independent set, if no two of its members are adjacent in $G$. The $k$-independent graph of $G$, $I_k (G)$, is defined to be the graph whose vertices correspond to the independent…
We classify the pairs $(X,\pi)$, where $\pi\colon X\to S$ is a $\mathbb{P}^1$-bundle over a non-rational geometrically ruled surface $S$ and $\mathrm{Aut}^\circ(X)$ is relatively maximal, i.e., maximal with respect to the inclusion in the…
A dominating set of a graph $G$ is a set $S \subseteq V(G)$ such that every vertex in $V(G) \setminus S$ has a neighbor in $S$, where two vertices are neighbors if they are adjacent. A secure dominating set of $G$ is a dominating set $S$ of…
Let $W(G)$ be the Wiener index of a graph $G$. We say that a vertex $v \in V(G)$ is a \v{S}olt\'es vertex in $G$ if $W(G - v) = W(G)$, i.e. the Wiener index does not change if the vertex $v$ is removed. In 1991, \v{S}olt\'es posed the…
Haemers conjectures that almost all graphs are determined by their spectra. Suppose $G \sim \mathcal{G}(n, p)$ is a random graph with each edge chosen independently with probability $p$ with $0 < p < 1$. Then $$\Pr(G \text{ is not…
The study of power domination in graphs arises from the problem of placing a minimum number of measurement devices in an electrical network while monitoring the entire network. A power dominating set of a graph is a set of vertices from…
Two graphs are co-spectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are co-spectral with it are isomorphic to it. We consider these…
A graph is one-ended if it contains a ray (a one way infinite path) and whenever we remove a finite number of vertices from the graph then what remains has only one component which contains rays. A vertex $v$ {\em dominates} a ray in the…