Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques naturelles / sciences mathematiquesVol. CXLIII, No. 36, pp. 81–88 (2011)
|
|
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques naturelles / sciences mathematiques Vol. CXLIII, No. 36, pp. 81–88 (2011) |
|
|
Controllable graphsD. Cvetkovic, P. Rowlinson, Z. Stanic and M.-G. YoonMathematical Institute SANU, P.O. Box 367, 11000 Belgrade, SerbiaInstitute of Computing Science and Mathematics, University of Stirling, Stirling FK9 4LA, Scotland, UK Faculty of Mathematics, University of Belgrade, 11000 Belgrade, Serbia Department of Precision Mechanical Engineering, Gangneung-Wonju National University, Gangnueng 120-702, Republic of Korea 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 Classification (MSC2000): 05C50, 93B05 Full text of the article: (for faster download, first choose a mirror)
Electronic fulltext finalized on: 9 Oct 2011. This page was last modified: 8 Apr 2013.
© 2011 Mathematical Institute of the Serbian Academy of Science and Arts
|