The following pages link to Controllable subsets in graphs (Q1929751):
Displayed 30 items.
- Main Q-eigenvalues and generalized Q-cospectrality of graphs (Q254748) (← links)
- Perfect state transfer in Laplacian quantum walk (Q295824) (← links)
- On strongly asymmetric and controllable primitive graphs (Q335330) (← links)
- A simple arithmetic criterion for graphs being determined by their generalized spectra (Q345094) (← links)
- Generalized spectral characterization of graphs revisited (Q396911) (← links)
- A remark on the generalized spectral characterization of the disjoint union of graphs (Q503776) (← links)
- Construction of graphs with distinct eigenvalues (Q507479) (← links)
- On the generalized spectral characterizations of Eulerian graphs (Q668057) (← links)
- The overgraphs of generalized cospectral controllable graphs (Q668064) (← links)
- Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\) (Q1713301) (← links)
- New families of graphs determined by their generalized spectrum (Q1727785) (← links)
- Low-degree factors of random polynomials (Q1741899) (← links)
- Note on graphs with irreducible characteristic polynomials (Q1979360) (← links)
- Cospectrality preserving graph modifications and eigenvector properties via walk equivalence of vertices (Q2029821) (← links)
- Graphs with \(n - 1\) main eigenvalues (Q2032715) (← links)
- Generalized spectral characterizations of almost controllable graphs (Q2033889) (← links)
- Eigenvectors and controllability of non-Hermitian random matrices and directed graphs (Q2042849) (← links)
- Unlocking the walk matrix of a graph (Q2137059) (← links)
- On a theorem of Godsil and McKay concerning the construction of cospectral graphs (Q2197138) (← links)
- Net Laplacian controllability for joins of signed graphs (Q2197420) (← links)
- Laplacian controllability classes for threshold graphs (Q2261563) (← links)
- A new method for constructing graphs determined by their generalized spectrum (Q2341905) (← links)
- Almost equitable partitions and new necessary conditions for network controllability (Q2407159) (← links)
- Controllability of undirected graphs (Q2451704) (← links)
- On a Conjecture of Godsil Concerning Controllable Random Graphs (Q2953321) (← links)
- How to suppress dark states in quantum networks and bio-engineered structures (Q4689536) (← links)
- Controllability of NEPSes of graphs (Q5084721) (← links)
- (Q5228090) (← links)
- Signed graphs whose all Laplacian eigenvalues are main (Q6057691) (← links)
- The Smith normal form of the walk matrix of the Dynkin graph \(D_n\) for \(n \equiv 0 \pmod{4}\) (Q6155676) (← links)