DC Field | Value | Language |
---|---|---|
dc.contributor.author | Simić, Slobodan | en |
dc.contributor.author | Li Marzi, Enzo Maria | en |
dc.contributor.author | Belardo, Francesco | en |
dc.date.accessioned | 2020-05-01T20:12:50Z | - |
dc.date.available | 2020-05-01T20:12:50Z | - |
dc.date.issued | 2008-02-06 | en |
dc.identifier.issn | 0012-365X | en |
dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/1167 | - |
dc.description.abstract | The index of a graph is the largest eigenvalue of its adjacency matrix. Among the trees with a fixed order and diameter, a graph with the maximal index is a caterpillar. In the set of caterpillars with a fixed order and diameter, or with a fixed degree sequence, we identify those whose index is maximal. | en |
dc.publisher | Elsevier | - |
dc.relation | Serbian Ministry of Science, Grant 1389 | - |
dc.relation | MIUR (cofin “Strutture geometriche, combinatorie e loro applicazioni”) | - |
dc.relation.ispartof | Discrete Mathematics | en |
dc.subject | Caterpillars | Degree sequence | Diameter | Eigenvalues | Index | Trees | en |
dc.title | On the index of caterpillars | en |
dc.type | Article | en |
dc.identifier.doi | 10.1016/j.disc.2006.11.046 | en |
dc.identifier.scopus | 2-s2.0-36348954310 | en |
dc.relation.firstpage | 324 | en |
dc.relation.lastpage | 330 | en |
dc.relation.issue | 2-3 | en |
dc.relation.volume | 308 | en |
dc.description.rank | M23 | - |
item.cerifentitytype | Publications | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.openairetype | Article | - |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
SCOPUSTM
Citations
20
checked on Jun 1, 2024
Page view(s)
31
checked on May 9, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.