Minimal Laplacian controllability problems of threshold graphs

DOI10.1049/IET-CTA.2018.5875MaRDI QIDQ5221130zbMATH OpenOpenAlexWikidataFDO

Authors Shun-Pin Hsu

Publication date 24 March 2020

Published in IET Control Theory \& Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1049/iet-cta.2018.5875

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Controllability (93B05)

Recommendations

• Laplacian controllability classes for threshold graphs
• Controllability of the multi-agent system modeled by the threshold graph with one repeated degree
• Laplacian controllability for graphs with integral Laplacian spectrum
• Controllability of undirected graphs
• Laplacian controllability for graphs obtained by some standard products

Cited in

(6)

• Laplacian controllability for graphs with integral Laplacian spectrum
• Laplacian controllability classes for threshold graphs
• On the selection of leaders for the controllability of multi-agent networks
• Chain graphs with simple Laplacian eigenvalues and their Laplacian dynamics
• Controllability of the multi-agent system modeled by the threshold graph with one repeated degree
• A Sylvester-Kac matrix type and the Laplacian controllability of half graphs

This page was built for publication: Minimal Laplacian controllability problems of threshold graphs

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