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

DOI10.1016/j.amc.2024.128702zbMATH Open1545.93064MaRDI QIDQ6585541FDOQ6585541

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)

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

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)

Cites Work

• Networks. An introduction.
• An introduction to the theory of graph spectra
• Title not available (Why is that?)
• Mathematical Description of Linear Dynamical Systems
• Structural controllability
• Title not available (Why is that?)
• Spectra of weighted uniform hypertrees
• On the adjacency spectra of hypertrees
• On the \(r\)-uniform linear hypertrees with extremal Estrada indices

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)