DC FieldValueLanguage
dc.contributor.authorCvetković, Dragošen
dc.contributor.authorDavidović, Tatjanaen
dc.date.accessioned2020-04-03T08:16:03Z-
dc.date.available2020-04-03T08:16:03Z-
dc.date.issued2008-01-01en
dc.identifier.issn0354-0243en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/269-
dc.description.abstractLet G be a graph with diameter D, maximum vertex degree Δ, the largest eigenvalue λ1 and m distinct eigenvalues. The products mΔ and (D+1) λ1 are called the tightness of G of the first and second type, respectively. In the recent literature it was suggested that graphs with a small tightness of the first type are good models for the multiprocessor interconnection networks. We study these and some other types of tightness and some related graph invariants and demonstrate their usefulness in the analysis of multiprocessor interconnection networks. Tightness values for graphs of some standard interconnection networks are determined. We also present some facts showing that the tightness of the second type is a relevant graph invariant. We prove that the number of connected graphs with a bounded tightness is finite.en
dc.publisherFakultet organizacionih nauka, Beograd-
dc.relationGraph theory and mathematical programming with applications in chemistry and engineering-
dc.relation.ispartofYugoslav Journal of Operations Researchen
dc.subjectDiameter | Interconnection topologies | Maximum vertex degree | Multiprocessor systems | Spectra of graphsen
dc.titleApplication of some graph invariants to the analysis of multiprocessor interconnection networksen
dc.typeArticleen
dc.identifier.doi10.2298/YJOR0802173Cen
dc.identifier.scopus2-s2.0-70349539357en
dc.relation.firstpage173en
dc.relation.lastpage186en
dc.relation.issue2en
dc.relation.volume18en
item.cerifentitytypePublications-
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.orcid0000-0001-9561-5339-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/projects/144015e.htm-
Show simple item record

SCOPUSTM   
Citations

10
checked on Jul 13, 2024

Page view(s)

64
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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