Geodesic
Construction and Analysis of Graph Models for Multiprocessor Interconnection Networks
Yugoslav journal of operations research, Tome 32 (2022) no. 1, p. 87 Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

Voir la notice de l'article

A graph G can serve as a model for the Multiprocessor Interconnection Networks (MINs) in which the vertices represent the processors, while the edges represent connections between processors. This paper presents several graphs that could qualify as models for efficient MINs based on the small values of the graph tightness previously introduced by Cvetković and Davidović in 2008. These graphs are constructed using some well-known and widely used graph operations. The tightness values of these graphs range from $O(\sqrt[4]{N})$ to $O(\sqrt{N})$, where N is the order of the graph under consideration. Also, two new graph tightness values, namely Third type mixed tightness $t_3(G)$ and Second type of Structural tightness $t_4(G)$ are defined in this paper. It has been shown that these tightness types are easier to calculate than the others for the considered graphs. Moreover, their values are significantly smaller.
Classification : 05C50, 68M10
Keywords: Interconnection Networks, Graph Tightness, Line Graph, Chromatic Number, Chromatic Index. 
@article{YJOR_2022_32_1_a4,
     author = {S.M. Hegde and Y.M. Saumya},
     title = {Construction and {Analysis} of {Graph} {Models} for {Multiprocessor} {Interconnection} {Networks}},
     journal = {Yugoslav journal of operations research},
     pages = {87 },
     year = {2022},
     volume = {32},
     number = {1},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/YJOR_2022_32_1_a4/}
}
TY  - JOUR
AU  - S.M. Hegde
AU  - Y.M. Saumya
TI  - Construction and Analysis of Graph Models for Multiprocessor Interconnection Networks
JO  - Yugoslav journal of operations research
PY  - 2022
SP  - 87 
VL  - 32
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/YJOR_2022_32_1_a4/
LA  - en
ID  - YJOR_2022_32_1_a4
ER  - 
%0 Journal Article
%A S.M. Hegde
%A Y.M. Saumya
%T Construction and Analysis of Graph Models for Multiprocessor Interconnection Networks
%J Yugoslav journal of operations research
%D 2022
%P 87 
%V 32
%N 1
%U http://geodesic.mathdoc.fr/item/YJOR_2022_32_1_a4/
%G en
%F YJOR_2022_32_1_a4
S.M. Hegde; Y.M. Saumya. Construction and Analysis of Graph Models for Multiprocessor Interconnection Networks. Yugoslav journal of operations research, Tome 32 (2022) no. 1, p. 87 . http://geodesic.mathdoc.fr/item/YJOR_2022_32_1_a4/