On strongly asymmetric and controllable primitive graphs
From MaRDI portal
(Redirected from Publication:335330)
Recommendations
Cites work
- scientific article; zbMATH DE number 701124 (Why is no real title available?)
- scientific article; zbMATH DE number 758277 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- scientific article; zbMATH DE number 3419161 (Why is no real title available?)
- A sufficient condition for a family of graphs being determined by their generalized spectra
- A table of connected graphs on six vertices
- Controllability of Multi-Agent Dynamical Systems with a Broadcasting Control Signal
- Controllability of undirected graphs
- Controllable graphs with least eigenvalue at least \(-2\)
- Controllable subsets in graphs
- Further results on controllable graphs
- Isomorph-Free Exhaustive Generation
- Recent results in the theory of graph spectra
- Spectral conditions for the reconstructibility of a graph
- The main eigenvalues and number of walks in self-complementary graphs
- The main eigenvalues of a graph: a survey
Cited in
(9)- Graphs with \(n - 1\) main eigenvalues
- Signed graphs with exactly two distinct main eigenvalues
- On the main eigenvalues of universal adjacency matrices and \(U\)-controllable graphs
- Controllability of NEPSes of graphs
- Almost controllable graphs and beyond
- The overgraphs of generalized cospectral controllable graphs
- On strongly asymmetric graphs
- scientific article; zbMATH DE number 7090165 (Why is no real title available?)
- Further results on almost controllable graphs
This page was built for publication: On strongly asymmetric and controllable primitive graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q335330)