login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A356669 The number of controllable graphs on n vertices. 2
1, 0, 0, 0, 0, 8, 92, 2332, 85036, 5578994 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
COMMENTS
This includes the disconnected graphs, C(n) of table 2 of [Farrugia]. The number of connected controllable graphs is 1,0,0,0,0,8,85,2275,83034, 5512362.
Note the probably wrong number for C(10) in Table 1 of [Yoon et al].
LINKS
Alexander Farrugia, On strongly asymmetric and controllable primitive graphs, Discrete Appl. Math. 211, 58-67 (2016).
Myung-Gon Yoon, Peter Rowlinson, Dragos Cvetkovic, and Zoran Stanic, Controllability of multi-agent dynamical systems with a broadcasting control signal, Asian J. Control 16 (4) (2014) 1066-1072.
Eric Weisstein's World of Mathematics, Controllable Graph
CROSSREFS
Cf. A371897 (connected controllable graphs).
Sequence in context: A184142 A358888 A137159 * A099291 A087579 A194043
KEYWORD
nonn,hard,more
AUTHOR
R. J. Mathar, Aug 22 2022
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 27 16:27 EDT 2024. Contains 372020 sequences. (Running on oeis4.)