DC FieldValueLanguage
dc.contributor.authorCvetković, Dragošen_US
dc.contributor.authorDavidović, Tatjanaen_US
dc.date.accessioned2020-07-13T12:31:22Z-
dc.date.available2020-07-13T12:31:22Z-
dc.date.issued2009-10-01-
dc.identifier.issn0129-0541-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/3811-
dc.description.abstractHomogeneous multiprocessor systems are usually modelled by undirected graphs. Vertices of these graphs represent the processors, while edges denote the connection links between adjacent processors. Let 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 recent literature it was suggested that graphs with a small tightness of the first type are good models for the multiprocessor interconnection networks. In a previous paper we studied these and some other types of tightness and some related graph invariants and demonstrated their usefulness in the analysis of multiprocessor interconnection networks. We proved that the number of connected graphs with a bounded tightness is finite. In this paper we determine explicitly graphs with tightness values not exceeding 9. There are 69 such graphs and they contain up to 10 vertices. In addition we identify graphs with minimal tightness values when the number of vertices is n = 2,..., 10.en_US
dc.publisherWorld Scientificen_US
dc.relation.ispartofInternational Journal of Foundations of Computer Scienceen_US
dc.subjectGraph Invariants | Interconnection Topologies | Multiprocessor Systems | Spectra of Graphsen_US
dc.titleMultiprocessor interconnection networks with small tightnessen_US
dc.typeArticleen_US
dc.identifier.doi10.1142/S0129054109006978-
dc.identifier.scopus2-s2.0-70349557829-
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Artsen_US
dc.relation.firstpage941-
dc.relation.lastpage963-
dc.relation.issue5-
dc.relation.volume20-
dc.description.rankM23-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0001-9561-5339-
Show simple item record

SCOPUSTM   
Citations

7
checked on Jan 29, 2023

Page view(s)

19
checked on Jan 30, 2023

Google ScholarTM

Check

Altmetric

Altmetric


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