Abstract
If G is a graph with n vertices, \(L_G\) is its Laplacian matrix, and \(\mathbf {b}\) is a binary vector of length n, then the pair \((L_G, \mathbf {b})\) is said to be controllable, and we also say that G is Laplacian controllable for \(\mathbf {b}\), if \(\mathbf {b}\) is non-orthogonal to any of the eigenvectors of \(L_G\). It is known that if G is Laplacian controllable, then it has no repeated Laplacian eigenvalues. If G has no repeated Laplacian eigenvalues and each of them is an integer, then G is decomposable into a (dominate) induced subgraph, say H, and another induced subgraph with at most three vertices. We express the Laplacian controllability of G in terms of that of H. In this way, we address the question on the Laplacian controllability of cographs and, in particular, threshold graphs.
Similar content being viewed by others
References
Aguilar, C.O., Gharesifard, B.: Laplacian controllability classes for threshold graphs. Linear Algebra Appl. 471, 575–586 (2015)
Bıyıkoğlu, T., Simić, S.K., Stanić, Z.: Some notes on spectra of cographs. Ars Combin. 100, 421–434 (2011)
Fallat, S.M., Kirkland, S.J., Molitierno, J.J., Neumann, M.: On graphs whose Laplacian matrices have distinct integer eigenvalues. J. Graph Theory 50, 162–174 (2005)
Klamka, J.: Controllability of Dynamical Systems. Kluwer Academic Publishers, Dordreht (1991)
Merris, R.: Laplacian graph eigenvectors. Linear Algebra Appl. 278, 221–236 (1998)
Rahmani, A., Ji, M., Mesbahi, M., Egerstedt, M.: Controllability of multi-agent systems from a graph theoretic perspective. SIAM J. Control Optim. 48, 162–186 (2009)
Stanić, Z.: Inequalities for Graph Eigenvalues. Cambridge University Press, Cambridge (2015)
Acknowledgements
Research is partially supported by Serbian Ministry of Education, Science and Technological Development via University of Belgrade.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Stanić, Z. Laplacian Controllability for Graphs with Integral Laplacian Spectrum. Mediterr. J. Math. 18, 35 (2021). https://doi.org/10.1007/s00009-020-01684-3
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00009-020-01684-3