On strongly asymmetric and controllable primitive graphs
From MaRDI portal
Publication:335330
DOI10.1016/J.DAM.2016.04.001zbMATH Open1348.05137OpenAlexW2345352110MaRDI QIDQ335330FDOQ335330
Authors: Alexander Farrugia 
Publication date: 2 November 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.04.001
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Controllable subsets in graphs
- A sufficient condition for a family of graphs being determined by their generalized spectra
- The main eigenvalues of a graph: a survey
- Controllable graphs with least eigenvalue at least \(-2\)
- Title not available (Why is that?)
- Recent results in the theory of graph spectra
- A table of connected graphs on six vertices
- Spectral conditions for the reconstructibility of a graph
- Controllability of undirected graphs
- Further results on controllable graphs
- The main eigenvalues and number of walks in self-complementary graphs
- Controllability of Multi-Agent Dynamical Systems with a Broadcasting Control Signal
- Title not available (Why is that?)
- Isomorph-Free Exhaustive Generation
Cited In (9)
- Title not available (Why is that?)
- Controllability of NEPSes of graphs
- On strongly asymmetric graphs
- Almost controllable graphs and beyond
- Further results on almost controllable graphs
- On the main eigenvalues of universal adjacency matrices and \(U\)-controllable graphs
- The overgraphs of generalized cospectral controllable graphs
- Signed graphs with exactly two distinct main eigenvalues
- Graphs with \(n - 1\) main eigenvalues
Uses Software
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)
