Pages that link to "Item:Q2953321"

The following pages link to On a Conjecture of Godsil Concerning Controllable Random Graphs (Q2953321):

Displaying 24 items.

• A simple arithmetic criterion for graphs being determined by their generalized spectra (Q345094) (← links)
• A note on non-\(\mathbb{R}\)-cospectral graphs (Q521370) (← 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)
• Graphs with \(n - 1\) main eigenvalues (Q2032715) (← links)
• Eigenvectors and controllability of non-Hermitian random matrices and directed graphs (Q2042849) (← links)
• Unlocking the walk matrix of a graph (Q2137059) (← links)
• Partial strong structural controllability (Q2139435) (← links)
• A new criterion for almost controllable graphs being determined by their generalized spectra (Q2166304) (← links)
• On a theorem of Godsil and McKay concerning the construction of cospectral graphs (Q2197138) (← links)
• The polynomial reconstruction problem: the first 50 years (Q2699914) (← links)
• Eigenvectors of random matrices of symmetric entry distributions (Q4644467) (← links)
• Pairing between zeros and critical points of random polynomials with independent roots (Q4645087) (← links)
• How to suppress dark states in quantum networks and bio-engineered structures (Q4689536) (← links)
• (Q4987374) (← links)
• On Stable Systems with Random Structure (Q5037499) (← links)
• On the smallest singular value of symmetric random matrices (Q5886337) (← links)
• Spectral multiplicity functions of adjacency operators of graphs and cospectral infinite graphs (Q6561508) (← links)
• Canonization of a random circulant graph by counting walks (Q6575405) (← links)
• On verification and design of input matrix for robust linear systems: complexity and polynomially solvable cases (Q6607529) (← links)