DC FieldValueLanguage
dc.contributor.authorCvetković, Dragošen
dc.contributor.authorSimić, Slobodanen
dc.contributor.authorCaporossi, Gillesen
dc.contributor.authorHansen, Pierreen
dc.date.accessioned2020-05-01T20:12:52Z-
dc.date.available2020-05-01T20:12:52Z-
dc.date.issued2001-12-01en
dc.identifier.issn0308-1087en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1181-
dc.description.abstractIn the set of bicolored trees with given numbers of black and of white vertices we describe those for which the largest eigenvalue is extremal (maximal or minimal). The results are first obtained by the automated system AutoGraphiX, developed in GERAD (Montreal), and verified afterwards by theoretical means. © 2001 OPA (Overseas Publishers Association) N.V. Published by license under the Gordon and Breach Science Publishers imprint, a member of the Taylor & Francis Group.en
dc.publisherTaylor & Francis-
dc.relation.ispartofLinear and Multilinear Algebraen
dc.subjectAutomated discovery | Eigenvalues | Graph theory | Indexen
dc.titleVariable neighborhood search for extremal graphs 3. On the largest eigenvalue of color-constrained treesen
dc.typeArticleen
dc.identifier.doi10.1080/03081080108818690-
dc.identifier.scopus2-s2.0-0013151445en
dc.relation.firstpage143en
dc.relation.lastpage160en
dc.relation.issue2en
dc.relation.volume49en
item.cerifentitytypePublications-
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
Show simple item record

SCOPUSTM   
Citations

27
checked on Jul 12, 2024

Page view(s)

32
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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