|Appears in Collections:||Computing Science and Mathematics Journal Articles|
|Peer Review Status:||Refereed|
|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.|
|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.|
|Rights:||Publisher is open-access. Open access publishing allows free access to and distribution of published articles where the author retains copyright of their work by employing a Creative Commons attribution licence. Proper attribution of authorship and correct citation details should be given|
|Controllable Graphs 2011.pdf||73.15 kB||Adobe PDF||View/Open|
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact firstname.lastname@example.org providing details and we will remove the Work from public display in STORRE and investigate your claim.