Graphs and controllability completion problems
From MaRDI portal
Recommendations
- Controllability by completions of partial upper triangular matrices
- Controllability of partially prescribed matrices
- On controllability of partially prescribed matrices
- Characteristic polynomials and controllability of partially prescribed matrices
- Controllability completion problems of partial upper triangular matrices∗
Cites work
Cited in
(11)- Controllability and completion of partial upper triangular matrices over rings
- \(r\)-numbers completion problems of partial upper canonical form. I
- Controllability of certain real symmetric matrices with application to controllability of graphs
- scientific article; zbMATH DE number 4090811 (Why is no real title available?)
- Linear control of live marked graphs
- Laplacian Dynamics on Cographs: Controllability Analysis Through Joins and Unions
- scientific article; zbMATH DE number 3693175 (Why is no real title available?)
- Constructing a controllable graph under edge constraints
- Further results on almost controllable graphs
- scientific article; zbMATH DE number 3943036 (Why is no real title available?)
- scientific article; zbMATH DE number 1182741 (Why is no real title available?)
This page was built for publication: Graphs and controllability completion problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5946188)