| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Stevanović, Dragan | en |
| dc.date.accessioned | 2020-05-01T20:13:05Z | - |
| dc.date.available | 2020-05-01T20:13:05Z | - |
| dc.date.issued | 2004-01-01 | en |
| dc.identifier.issn | 0095-8956 | en |
| dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/1304 | - |
| dc.description.abstract | We give an upper bound for the largest eigenvalue of a nonregular graph with n vertices and the largest vertex degree Δ. | en |
| dc.publisher | Elsevier | - |
| dc.relation | Serbian Ministry of Science, Technology and Development, Grant 1389 | - |
| dc.relation.ispartof | Journal of Combinatorial Theory. Series B | en |
| dc.subject | Graph | Largest eigenvalue | en |
| dc.title | The largest eigenvalue of nonregular graphs | en |
| dc.type | Article | en |
| dc.identifier.doi | 10.1016/j.jctb.2003.12.002 | en |
| dc.identifier.scopus | 2-s2.0-2342522770 | en |
| dc.relation.firstpage | 143 | en |
| dc.relation.lastpage | 146 | en |
| dc.relation.issue | 1 | en |
| dc.relation.volume | 91 | en |
| dc.description.rank | M21 | - |
| item.fulltext | No Fulltext | - |
| item.grantfulltext | none | - |
| item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
| item.cerifentitytype | Publications | - |
| item.openairetype | Article | - |
| crisitem.author.orcid | 0000-0003-2908-305X | - |
SCOPUSTM
Citations
48
checked on May 15, 2026
Page view(s)
113
checked on May 14, 2026
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.