  Let $G$ be a simple, undirected graph on the vertex set $V=\{1,2,\ldots ,n\}$
and let $A$ be the adjacency matrix of $G.$ A non-empty subset $
\{i_{1},i_{2},\ldots ,i_{k}\}$ of $V$ is called a driver set for $G$ if the
system $\mathbf{\dot{x}}=A\mathbf{x}+u_{1}\mathbf{e}_{i_{1}}+\cdots +u_{k}
\mathbf{e}_{i_{k}}$ is controllable.
  In this paper we classify the minimal driver sets for the path and cycle
graphs $P_{n}$ and $C_{n}$ for all values of $n$ and we determine which of
those minimal driver sets render the system to be strongly structural
controllable with respect to the family of all symmetric matrices $X$
satisfying $x_{ij}=0\Leftrightarrow a_{ij}=0.$
  Note that this new type of strong structural controllability requires all
diagonal elements of the system matrix to be equal to zero so for example the
Laplacian matrix is not included in the family.
  Keywords: System, graph, (structural) controllability, driver set.
  MSC: 05C50, 05C69, 93B05, 93B25
