Controllable Subsets in Graphs

Details Controllable Subsets in Graphs Controllable Subsets in Graphs

2010-10-15

arxiv.org/abs/1010.3231v1

Mathematics

Combinatorics

14 pages

Scientific paper

Let $X$ be a graph on $v$ vertices with adjacency matrix $A$, and let let $S$ be a subset of its vertices with characteristic vector $z$. We say that the pair $(X,S)$ is controllable if the vectors $A^rz$ for $r=1,\ldots,v-1$ span $\mathbb{R}^v$. Our concern is chiefly with the cases where $S=V(X)$, or $S$ is a single vertex. In this paper we develop the basic theory of controllable pairs. We will see that if $(X,S)$ is controllable then the only automorphism of $X$ that fixes $S$ as a set is the identity. If $(X,S)$ is controllable for some subset $S$ then the eigenvalues of $A$ are all simple.

Affiliated with

Also associated with

No associations

Rating

Controllable Subsets in Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Controllable Subsets in Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Controllable Subsets in Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-204524