*Assistant Professor, Department of Mathematics, Srimad Andavan Arts and Science College (Autonomous), T.V. Kovil, Trichy-5, E-mail: ponmudims@gmail.com
**Assistant Professor, Department of Mathematics, Srimad Andavan Arts and Science College (Autonomous), T.V. Kovil, Trichy-5. andavanmathsramesh@gmail.com
MSc code: 15A48
In this paper we are interested in C-matrix completion problem, when a partial C-matrix has C-matrix completion. An nxn complex matrix is called a C-matrix if all its principal minors are negative. Here a combinatorially symmetric partial C-matrix has C-matrix completion if the graph of its specified entries is a 1chordal graph, and then there exists C-matrix completion for a partial C-matrix whose associated graph is an undirected cycle.
Matrix, Partial matrix, Completion problem, Undirected graph
