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/18445
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBell, Francis Ken_UK
dc.contributor.authorCvetkovic, Dragosen_UK
dc.contributor.authorRowlinson, Peteren_UK
dc.contributor.authorSimic, Slobodan Ken_UK
dc.date.accessioned2014-01-28T23:13:43Z-
dc.date.available2014-01-28T23:13:43Z-
dc.date.issued2008-07en_UK
dc.identifier.urihttp://hdl.handle.net/1893/18445-
dc.description.abstractLet G be a connected graph whose least eigenvalue λ(G) is minimal among the connected graphs of prescribed order and size. We show first that either G is complete or λ(G) is a simple eigenvalue. In the latter case, the sign pattern of a corresponding eigenvector determines a partition of the vertex set, and we study the structure of G in terms of this partition. We find that G is either bipartite or the join of two graphs of a simple form.en_UK
dc.language.isoenen_UK
dc.publisherElsevieren_UK
dc.relationBell FK, Cvetkovic D, Rowlinson P & Simic SK (2008) Graphs for which the least eigenvalue is minimal, I. Linear Algebra and Its Applications, 429 (1), pp. 234-241. https://doi.org/10.1016/j.laa.2008.02.032en_UK
dc.rightsMade available under an Elsevier Open Archive user license: Articles published under an Elsevier user license are protected by copyright and may be used for non-commercial purposes. Users may access, download, copy, display, redistribute, adapt, translate, text mine and data mine the articles provided that users: •Cite the article using an appropriate bibliographic citation (i.e. author(s), journal, article title, volume, issue, page numbers, DOI and the link to the definitive published version on ScienceDirect) •Use the article for non- commercial purposes •Maintain the integrity of the article •Retain copyright notices and links to these terms and conditions so it is clear to other users what can and cannot be done with the article •Ensure that, for any content in the article that is identified as belonging to a third party, any re-use complies with the copyright policies of that third party This is a non commercial license where the use of published articles for commercial purposes is prohibited.en_UK
dc.subjectGraph spectrumen_UK
dc.subjectLargest eigenvalueen_UK
dc.subjectLeast eigenvalueen_UK
dc.subjectNested split graphen_UK
dc.titleGraphs for which the least eigenvalue is minimal, Ien_UK
dc.typeJournal Articleen_UK
dc.identifier.doi10.1016/j.laa.2008.02.032en_UK
dc.citation.jtitleLinear Algebra and its Applicationsen_UK
dc.citation.issn0024-3795en_UK
dc.citation.volume429en_UK
dc.citation.issue1en_UK
dc.citation.spage234en_UK
dc.citation.epage241en_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.affiliationUniversity of Stirlingen_UK
dc.contributor.affiliationUniversity of Belgradeen_UK
dc.contributor.affiliationMathematicsen_UK
dc.contributor.affiliationMathematical Institute SANUen_UK
dc.identifier.isiWOS:000256569500020en_UK
dc.identifier.scopusid2-s2.0-43049137654en_UK
dc.identifier.wtid803751en_UK
dc.contributor.orcid0000-0003-4878-3203en_UK
dcterms.dateAccepted2008-07-31en_UK
dc.date.filedepositdate2014-01-28en_UK
rioxxterms.typeJournal Article/Reviewen_UK
rioxxterms.versionVoRen_UK
local.rioxx.authorBell, Francis K|en_UK
local.rioxx.authorCvetkovic, Dragos|en_UK
local.rioxx.authorRowlinson, Peter|0000-0003-4878-3203en_UK
local.rioxx.authorSimic, Slobodan K|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.filenamegraphs for which.pdfen_UK
local.rioxx.filecount1en_UK
local.rioxx.source0024-3795en_UK
Appears in Collections:Computing Science and Mathematics Journal Articles

Files in This Item:
File Description SizeFormat 
graphs for which.pdfFulltext - Published Version130.34 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.