Abstract
In this paper we are interested in the controllability completion problem when some assumptions about the graph associated with the specified entries of the partial matrix are made. We analyze combinatorially and noncombinatorially symmetric partial matrices when their graphs are cycles or paths. Noncombinatorially symmetric partial matrices with acyclic directed graphs are also studied. © 2001 Elsevier Science Inc. All rights reserved.
Keywords
Graph theory Partial matrix Controllability Controllability completion problems
Referencia
C. Jordán, J.R. Torregrosa, A.M. Urbano (2000): Graph and controllability completion problems. Linear Algebra and its Applications 332–334 (2001) 355–370.
