Title of article
Graphs and controllability completion problems
Author/Authors
C. Jord?n، نويسنده , , J. R. Torregrosa، نويسنده , , A. M. Urbano، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
16
From page
355
To page
370
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.
Keywords
Controllability , Controllability completion problems , graph theory , Partial matrix
Journal title
Linear Algebra and its Applications
Serial Year
2001
Journal title
Linear Algebra and its Applications
Record number
823308
Link To Document