DC FieldValueLanguage
dc.contributor.authorBelardo, Francescoen
dc.contributor.authorPisanski, Tomažen
dc.contributor.authorSimić, Slobodanen
dc.date.accessioned2020-05-01T20:12:46Z-
dc.date.available2020-05-01T20:12:46Z-
dc.date.issued2016-08-02en
dc.identifier.issn0308-1087en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1117-
dc.description.abstractGraphs with least eigenvalue greater than or equal to -2 are to a big extent studied by Hoffman and other authors from the early beginning of the spectral graph theory. Most of these results are summarized in the monograph [Cvetković D, Rowlinson P, Simić S. Spectral generalizations of line graphs, on graphs with least eigenvalue -2 , Cambridge University Press, 2004], and the survey paper [Cvetković D, Rowlinson P, Simić S. Graphs with least eigenvalue -2 : ten years on, Linear Algebra Appl. 2015;484:504–539] which is aimed to cover the next 10 years since their monograph appeared. Here, we add some further results. Among others, we identify graphs whose least eigenvalue is greater than -2 , but closest to -2 within the graphs of fixed order. Some consequences of these considerations are found in the context of the highest occupied molecular orbital–lowest unoccupied molecular orbital invariants.en
dc.publisherTaylor & Francis-
dc.relationUniversity of Primorska OP RCV_VS-13–25, the operation number 3330–14–500033-
dc.relationARRS, Grant number P1-0294-
dc.relationGraph theory and mathematical programming with applications in chemistry and computer science-
dc.relation.ispartofLinear and Multilinear Algebraen
dc.subjectadjacency matrix | HOMO–LUMO | least eigenvalue | line graph | signed graph | subdivision graphen
dc.titleOn graphs whose least eigenvalue is greater than –2en
dc.typeArticleen
dc.identifier.doi10.1080/03081087.2015.1107020en
dc.identifier.scopus2-s2.0-84946433938en
dc.relation.firstpage1570en
dc.relation.lastpage1582en
dc.relation.issue8en
dc.relation.volume64en
dc.description.rankM21-
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/174033e.php-
crisitem.project.fundingProgramDirectorate for Computer & Information Science & Engineering-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/Directorate for Computer & Information Science & Engineering/1740333-
Show simple item record

SCOPUSTM   
Citations

3
checked on Apr 4, 2025

Page view(s)

22
checked on Jan 31, 2025

Google ScholarTM

Check


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