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.relation.ispartofLinear Algebra and Its Applicationsen
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.urlhttps://api.elsevier.com/content/abstract/scopus_id/84927164157-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.firstpage148en
dc.relation.lastpage164en
dc.relation.volume477en
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

1
checked on Nov 10, 2024

Page view(s)

15
checked on Nov 15, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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