Article

Controllable graphs

Details

Citation

Cvetkovic D, Rowlinson P, Stanic Z & Yoon M (2011) Controllable graphs. Bulletin, Classe des Sciences Mathematiques et Naturelles, Sciences Mathematiques, 143 (36), pp. 81-88. http://www.emis.de/journals/BSANU/36/6.html

Abstract
The eigenvalues of a graph are the eigenvalues of its adjacency matrix. An eigenvalue of a graph is called main if the corresponding eigenspace contains a vector for which the sum of coordinates is different from 0. Connected graphs in which all eigenvalues are mutually distinct and main have recently attracted attention in control theory.

Keywords
graph theory; control theory; graph spectra; main eigenvalues; controllability

Journal
Bulletin, Classe des Sciences Mathematiques et Naturelles, Sciences Mathematiques: Volume 143, Issue 36

StatusPublished
Publication date31/12/2011
URLhttp://hdl.handle.net/1893/18511
PublisherMathematical Institute of SANU, Belgrade
Publisher URLhttp://www.emis.de/journals/BSANU/36/6.html
ISSN0561-7332

People (1)

Professor Peter Rowlinson

Professor Peter Rowlinson

Emeritus Professor, Mathematics