On strongly asymmetric and controllable primitive graphs
type: Item
instance of: scholarly article
title: On strongly asymmetric and controllable primitive graphs
zbMATH Open document ID: 1348.05137
author: Alexander Farrugia
published in: Discrete Applied Mathematics
publication date: 2016-11-02T00:00:00Z
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 6646861
zbMATH Keywords: controllable graph
zbMATH Keywords: controllable primitive graph
zbMATH Keywords: strongly asymmetric graph
describes a project that uses: OEIS
MaRDI profile type: Publication
full work available at URL: j.dam.2016.04.001
OpenAlex ID: W2345352110
cites work: Recent results in the theory of graph spectra
cites work: A table of connected graphs on six vertices
cites work: Controllable graphs with least eigenvalue at least -2
cites work: Controllability of undirected graphs
cites work: The main eigenvalues and number of walks in self-complementary graphs
cites work: Controllable subsets in graphs
cites work: Spectral conditions for the reconstructibility of a graph
cites work: Q5682013
cites work: Q4902474
cites work: Q4316723
cites work: Isomorph-Free Exhaustive Generation
cites work: Q3184855
cites work: Q4834167
cites work: Further results on controllable graphs
cites work: A sufficient condition for a family of graphs being determined by their generalized spectra
cites work: Controllability of Multi-Agent Dynamical Systems with a Broadcasting Control Signal
DOI: 10.1016/J.DAM.2016.04.001
description: scientific article; zbMATH DE number 6646861