On strongly asymmetric and controllable primitive graphs

DOI10.1016/j.dam.2016.04.001zbMath1348.05137OpenAlexW2345352110MaRDI QIDQ335330

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

zbMATH Keywords

controllable graphcontrollable primitive graphstrongly asymmetric graph

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Unnamed Item ⋮ Controllability of NEPSes of graphs ⋮ Further results on almost controllable graphs ⋮ Almost controllable graphs and beyond ⋮ The overgraphs of generalized cospectral controllable graphs ⋮ Graphs with \(n - 1\) main eigenvalues

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A table of connected graphs on six vertices
• Recent results in the theory of graph spectra
• Spectral conditions for the reconstructibility of a graph
• Controllable subsets in graphs
• Controllability of undirected graphs
• A sufficient condition for a family of graphs being determined by their generalized spectra
• 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
• Isomorph-Free Exhaustive Generation
• Controllable graphs with least eigenvalue at least -2