In this paper we are interested in the controllability completion problem w
hen some assumptions about the graph associated with the specified entries
of the partial matrix are made. We analyze combinatorially and noncombinato
rially symmetric partial matrices when their graphs are cycles or paths. No
ncombinatorially symmetric partial matrices with acyclic directed graphs ar
e also studied. (C) 2001 Elsevier Science Inc. All rights reserved.