On the minimum driver node set of k-uniform linear hypertree networks

DOI10.1016/j.amc.2024.128702MaRDI QIDQ6585541zbMATH OpenFDO

Authors Liang Wei, Faxu Li, Haixing Zhao, Bo Deng

Publication date 12 August 2024

Published in Applied Mathematics and Computation (Search for Journal in Brave)

zbMATH Keywords

algorithmexact controllability2-section graphminimum driver node setuniform hypernetwork

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Controllability (93B05) Eigenvalue problems (93B60) Linear systems in control theory (93C05)

Recommendations

• scientific article; zbMATH DE number 7156464
• Minimum structural controllability problems of complex networks
• Controllability and algorithms of complex networks
• Minimum-cost control of complex networks
• Controllability emerging from conditional path reachability in complex networks

Cites work

• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3337198 (Why is no real title available?)
• An introduction to the theory of graph spectra
• Mathematical Description of Linear Dynamical Systems
• Networks. An introduction.
• On the r-uniform linear hypertrees with extremal Estrada indices
• On the adjacency spectra of hypertrees
• Spectra of weighted uniform hypertrees
• Structural controllability

This page was built for publication: On the minimum driver node set of \(k\)-uniform linear hypertree networks

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