Controllable subsets in graphs
From MaRDI portal
Publication:1929751
DOI10.1007/s00026-012-0156-3zbMath1256.05139arXiv1010.3231MaRDI QIDQ1929751
Publication date: 9 January 2013
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.3231
93B05: Controllability
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
15A99: Basic linear algebra
Related Items
How to suppress dark states in quantum networks and bio-engineered structures, Unnamed Item, Controllability of NEPSes of graphs, Signed graphs whose all Laplacian eigenvalues are main, The Smith normal form of the walk matrix of the Dynkin graph \(D_n\) for \(n \equiv 0 \pmod{4}\), Main Q-eigenvalues and generalized Q-cospectrality of graphs, Perfect state transfer in Laplacian quantum walk, On strongly asymmetric and controllable primitive graphs, A simple arithmetic criterion for graphs being determined by their generalized spectra, Generalized spectral characterization of graphs revisited, A remark on the generalized spectral characterization of the disjoint union of graphs, Construction of graphs with distinct eigenvalues, On the generalized spectral characterizations of Eulerian graphs, The overgraphs of generalized cospectral controllable graphs, Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\), New families of graphs determined by their generalized spectrum, Low-degree factors of random polynomials, Note on graphs with irreducible characteristic polynomials, Cospectrality preserving graph modifications and eigenvector properties via walk equivalence of vertices, Graphs with \(n - 1\) main eigenvalues, Generalized spectral characterizations of almost controllable graphs, Eigenvectors and controllability of non-Hermitian random matrices and directed graphs, Unlocking the walk matrix of a graph, On a theorem of Godsil and McKay concerning the construction of cospectral graphs, Net Laplacian controllability for joins of signed graphs, Laplacian controllability classes for threshold graphs, A new method for constructing graphs determined by their generalized spectrum, Almost equitable partitions and new necessary conditions for network controllability, Controllability of undirected graphs, On a Conjecture of Godsil Concerning Controllable Random Graphs
Cites Work
