1. Research with MATF
  2. MATF
  3. Research outputs
Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/777
DC FieldValueLanguage
dc.contributor.authorJovović, Ivanaen_US
dc.contributor.authorKoledin, Tamaraen_US
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2022-08-15T15:00:17Z-
dc.date.available2022-08-15T15:00:17Z-
dc.date.issued2015-07-15-
dc.identifier.issn00243795en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/777-
dc.description.abstractAbstract In this paper we determine the unique graph with minimal least eigenvalue (of the adjacency matrix) within the set of connected graphs of fixed order n and size m, whenever; (formula presented), where a is a fixed integral constant in; (formula presented).en
dc.publisherElsevieren_US
dc.relation.ispartofLinear Algebra and Its Applicationsen_US
dc.subjectAdjacency matrixen
dc.subjectExtremal graphsen
dc.subjectNested split graphen
dc.subjectThe least eigenvalueen
dc.titleNon-bipartite graphs of fixed order and size that minimize the least eigenvalueen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.laa.2015.03.027-
dc.identifier.scopus2-s2.0-84927164157-
dc.identifier.isi000355040700008-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/84927164157-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.issn0024-3795en_US
dc.description.rankM21en_US
dc.relation.firstpage148en_US
dc.relation.lastpage164en_US
dc.relation.volume477en_US
item.openairetypeArticle-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
crisitem.author.deptNumerical Mathematics and Optimization-
crisitem.author.orcid0000-0002-4949-4203-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

1
checked on Mar 28, 2025

Page view(s)

16
checked on Jan 19, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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