Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/749
DC FieldValueLanguage
dc.contributor.authorCvetković, Dragošen_US
dc.contributor.authorRowlinson, Peteren_US
dc.contributor.authorStanić, Zoranen_US
dc.contributor.authorYoon, Myung Gonen_US
dc.date.accessioned2022-08-15T15:00:14Z-
dc.date.available2022-08-15T15:00:14Z-
dc.date.issued2011-12-01-
dc.identifier.issn05617332en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/749-
dc.description.abstractThe 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.en
dc.relation.ispartofBulletin, Classe des Sciences Mathematiques et Naturelles, Sciences Mathematiquesen
dc.subjectControl theoryen
dc.subjectControllabilityen
dc.subjectGraph spectraen
dc.subjectGraph theoryen
dc.subjectMain eigenvaluesen
dc.titleControllable graphsen_US
dc.typeArticleen_US
dc.identifier.scopus2-s2.0-84857349224-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/84857349224-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.firstpage81en
dc.relation.lastpage88en
dc.relation.volume143en
dc.relation.issue36en
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
crisitem.author.deptNumerical Mathematics and Optimization-
crisitem.author.orcid0000-0002-4949-4203-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

25
checked on Nov 8, 2024

Page view(s)

13
checked on Nov 15, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.