Construction of graphs with distinct A_ -eigenvalues
From MaRDI portal
Publication:6184540
Recommendations
Cites work
- A new arithmetic criterion for graphs being determined by their generalized \(Q\)-spectrum
- A new graph product and its spectrum
- A simple arithmetic criterion for graphs being determined by their generalized spectra
- An arithmetic criterion for graphs being determined by their generalized \(A_\alpha \)-spectra
- Construction of graphs with distinct eigenvalues
- Controllability of Multi-Agent Dynamical Systems with a Broadcasting Control Signal
- Controllable graphs
- Controllable graphs with least eigenvalue at least \(-2\)
- Generalized spectral characterization of rooted product graphs
- Generalized spectral characterizations of almost controllable graphs
- Merging the \(A\)- and \(Q\)-spectral theories
- On the construction of Q-controllable graphs
- On the main eigenvalues of universal adjacency matrices and \(U\)-controllable graphs
- The theorems of Stieltjes and Favard
- Universal adjacency matrices with two eigenvalues
Cited in
(1)
This page was built for publication: Construction of graphs with distinct \(A_\alpha \)-eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6184540)