The Generalized 4-Connectivity of Cube-Connected-Cycle and Hierarchical Hypercube

Jinyu Zou, He Li, Haizhen Ren and G. Muhiuddin

Journal of Mathematics, 2022, vol. 2022, 1-9

Abstract: The connectivity is an important measurement for the fault tolerance of a network. Let G=VG,EG be a connected graph with the vertex set VG and edge set EG. An S-tree of graph G is a tree T that contains all the vertices in S subject to S⊆VG. Two S-trees T and T′ are internally disjoint if and only if ET∩ET′=∅ and VT∩VT′=S. Denote κGS by the maximum number of internally disjoint S-trees in graph G. The generalized k-connectivity is a natural generalization of the classical connectivity, which is defined as κrG=minκGS|S⊆VGandS=r. In this paper, we mainly focus on the generalized connectivity of cube-connected-cycle CCCn and hierarchical hypercube HHCn, which were introduced for massively parallel systems. We show that for n=2m+2m≥1, κ4HHCn=m and κ4CCCn=2, that is, for any four vertices in CCCn (or HHCn), there exist 2 (or m) internally disjoint S-trees connecting them in CCCn (or HHCn).

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2022/2766404.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2022/2766404.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:2766404

DOI: 10.1155/2022/2766404

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().