Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/773
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:17Z-
dc.date.available2022-08-15T15:00:17Z-
dc.date.issued2011-10-01-
dc.identifier.issn14528630en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/773-
dc.description.abstractConnected graphs whose eigenvalues are distinct and main are called controllable graphs in view of certain applications in control theory. We give some general characterizations of the controllable graphs whose least eigenvalue is bounded from below by -2; in particular, we determine all the controllable exceptional graphs. We also investigate the controllable graphs whose second largest eigenvalue does not exceed 1.en
dc.relation.ispartofApplicable Analysis and Discrete Mathematicsen
dc.subjectBounded eigenvaluesen
dc.subjectControl theoryen
dc.subjectGraph spectraen
dc.subjectMain eigenvaluesen
dc.titleControllable graphs with least eigenvalue at least -2en_US
dc.typeArticleen_US
dc.identifier.doi10.2298/AADM110909022C-
dc.identifier.scopus2-s2.0-84857297555-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/84857297555-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.firstpage165en
dc.relation.lastpage175en
dc.relation.volume5en
dc.relation.issue2en
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

26
checked on Nov 9, 2024

Page view(s)

16
checked on Nov 15, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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