当前位置: X-MOL 学术Int. J. Found. Comput. Sci. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
The (n,k)-Modified-Bubble-Sort Graph: A Generalized Modified-Bubble-Sort Graph
International Journal of Foundations of Computer Science ( IF 0.6 ) Pub Date : 2021-05-24 , DOI: 10.1142/s0129054121500258
Mengyue Cao 1 , Tongtong Ding 1 , Min Xu 1
Affiliation  

In this paper, we present a new interconnection topology, called the(n,k)-modified-bubble-sort graph, which is a generalization of the modified-bubble-sort graph. Additionally, we show many of its properties, such as its hierarchical structure, vertex transitivity, connectivity, edge-connectivity, super connectivity and super edge-connectivity. The (n,k)-modified-bubble-sort graph presents more flexibility than the modified-bubble-sort graph in terms of its major design properties.

中文翻译:

(n,k)-修正冒泡排序图:广义修正冒泡排序图

在本文中,我们提出了一种新的互连拓扑,称为(n,ķ)-修改冒泡排序图,这是修改冒泡排序图的推广。此外,我们展示了它的许多属性,例如它的层次结构、顶点传递性、连通性、边-连通性、超连通性和超边-连通性。这(n,ķ)-修改冒泡排序图在其主要设计属性方面比修改冒泡排序图具有更大的灵活性。
更新日期:2021-05-24
down
wechat
bug