1. STORRE
  2. Faculty of Natural Sciences
  3. Computing Science and Mathematics
  4. Computing Science and Mathematics Journal Articles
Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/18444
Full metadata record
DC FieldValueLanguage
dc.contributor.authorCvetkovic, Dragosen_UK
dc.contributor.authorRowlinson, Peteren_UK
dc.contributor.authorStanic, Zoranen_UK
dc.contributor.authorYoon, Myung-Gonen_UK
dc.date.accessioned2014-05-24T23:17:30Z-
dc.date.available2014-05-24T23:17:30Z-
dc.date.issued2011-10en_UK
dc.identifier.urihttp://hdl.handle.net/1893/18444-
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_UK
dc.language.isoenen_UK
dc.publisherUniversity of Belgrade and Academic Minden_UK
dc.relationCvetkovic D, Rowlinson P, Stanic Z & Yoon M (2011) Controllable graphs with least eigenvalue at least -2. Applicable Analysis and Discrete Mathematics, 5 (2), pp. 165-175. https://doi.org/10.2298/AADM110909022Cen_UK
dc.rightsPublisher 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.en_UK
dc.subjectgraph spectraen_UK
dc.subjectcontrol theoryen_UK
dc.subjectmain eigenvaluesen_UK
dc.subjectbounded eigenvaluesen_UK
dc.titleControllable graphs with least eigenvalue at least -2en_UK
dc.typeJournal Articleen_UK
dc.identifier.doi10.2298/AADM110909022Cen_UK
dc.citation.jtitleApplicable Analysis and Discrete Mathematicsen_UK
dc.citation.issn1452-8630en_UK
dc.citation.volume5en_UK
dc.citation.issue2en_UK
dc.citation.spage165en_UK
dc.citation.epage175en_UK
dc.citation.publicationstatusPublisheden_UK
dc.citation.peerreviewedRefereeden_UK
dc.type.statusVoR - Version of Recorden_UK
dc.author.emailpeter.rowlinson@stir.ac.uken_UK
dc.contributor.affiliationMathematical Institute SANUen_UK
dc.contributor.affiliationMathematicsen_UK
dc.contributor.affiliationUniversity of Belgradeen_UK
dc.contributor.affiliationGangneung-Wonju National Universityen_UK
dc.identifier.isiWOS:000295490300001en_UK
dc.identifier.scopusid2-s2.0-84857297555en_UK
dc.identifier.wtid654610en_UK
dc.contributor.orcid0000-0003-4878-3203en_UK
dcterms.dateAccepted2011-10-31en_UK
dc.date.filedepositdate2014-01-28en_UK
rioxxterms.typeJournal Article/Reviewen_UK
rioxxterms.versionVoRen_UK
local.rioxx.authorCvetkovic, Dragos|en_UK
local.rioxx.authorRowlinson, Peter|0000-0003-4878-3203en_UK
local.rioxx.authorStanic, Zoran|en_UK
local.rioxx.authorYoon, Myung-Gon|en_UK
local.rioxx.projectInternal Project|University of Stirling|https://isni.org/isni/0000000122484331en_UK
local.rioxx.freetoreaddate2014-01-28en_UK
local.rioxx.licencehttp://www.rioxx.net/licenses/all-rights-reserved|2014-01-28|en_UK
local.rioxx.filenameControllable Graphs with least eigenvalue.pdfen_UK
local.rioxx.filecount1en_UK
local.rioxx.source1452-8630en_UK
Appears in Collections:Computing Science and Mathematics Journal Articles

Files in This Item:
File Description SizeFormat 
Controllable Graphs with least eigenvalue.pdfFulltext - Published Version157.99 kBAdobe PDFView/Open


This item is protected by original copyright

View License
Show simple item record


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

The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.