|Mathematical Institute of the Serbian Academy of Sciences and Arts
|Multiprocessor interconnection networks with small tightness
|International Journal of Foundations of Computer Science
Homogeneous 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.
|Graph Invariants | Interconnection Topologies | Multiprocessor Systems | Spectra of Graphs
Show full item record
checked on Feb 17, 2024
checked on Feb 21, 2024
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.