DC Field | Value | Language |
---|---|---|
dc.contributor.author | Petrović, Miroslav | en |
dc.contributor.author | Simić, Slobodan | en |
dc.date.accessioned | 2020-05-01T20:12:47Z | - |
dc.date.available | 2020-05-01T20:12:47Z | - |
dc.date.issued | 2015-06-04 | en |
dc.identifier.issn | 0024-3795 | en |
dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/1125 | - |
dc.description.abstract | In this paper the unique graph with maximal index (i.e. the largest eigenvalue of the adjacency matrix) is identified among all connected bipartite graphs of order n and size n+k, under the assumption that k≥0 and n≥k+5. | en |
dc.publisher | Elsevier | - |
dc.relation | Graph theory and mathematical programming with applications in chemistry and computer science | - |
dc.relation.ispartof | Linear Algebra and Its Applications | en |
dc.subject | Adjacency matrix | Bipartite chain graphs | Double nested graphs | Graph spectrum | Largest eigenvalue | en |
dc.title | A note on connected bipartite graphs of fixed order and size with maximal index | en |
dc.type | Article | en |
dc.identifier.doi | 10.1016/j.laa.2015.05.013 | en |
dc.identifier.scopus | 2-s2.0-84930942280 | en |
dc.contributor.affiliation | Mathematical Institute of the Serbian Academy of Sciences and Arts | - |
dc.relation.firstpage | 21 | en |
dc.relation.lastpage | 29 | en |
dc.relation.volume | 483 | en |
dc.description.rank | M21 | - |
item.cerifentitytype | Publications | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
item.openairetype | Article | - |
crisitem.project.projectURL | http://www.mi.sanu.ac.rs/novi_sajt/research/projects/174033e.php | - |
crisitem.project.fundingProgram | Directorate for Computer & Information Science & Engineering | - |
crisitem.project.openAire | info:eu-repo/grantAgreement/NSF/Directorate for Computer & Information Science & Engineering/1740333 | - |
SCOPUSTM
Citations
9
checked on Jan 21, 2025
Page view(s)
25
checked on Jan 21, 2025
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.