The minimum rank completion problems for tri-diagonal partial full sign patterns

zbMATH Open1424.05273MaRDI QIDQ4625537FDOQ4625537

Authors:

Publication date: 22 February 2019

Recommendations

• The minimum rank completion problems for tri-diagonal partial full sign patterns
• Minimum structural controllability problems of complex networks
• Zero forcing number, constrained matchings and strong structural controllability
• scientific article; zbMATH DE number 7156464
• Controllability and algorithms of complex networks

zbMATH Keywords

sign pattern matrixdirected networks systemminimum driving nodeminimum zero forcing numbersign bipartite graph

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Controllability (93B05) Decentralized systems (93A14)

Cited In (1)

• The minimum rank completion problems for tri-diagonal partial full sign patterns

This page was built for publication: The minimum rank completion problems for tri-diagonal partial full sign patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4625537)