Super spanning connectivity of the generalized hypercube network

The generalized hypercube G ( m 1 , m 2 , … , m n ) is one of the key interconnection networks with attractive topological properties. In this paper, we focus our attention on the super spanning connectivity of G ( m 1 , m 2 , … , m n ) . We show that for a pair of arbitrary nodes x and y in G ( m 1 , m 2 , … , m n ) ( m i ≥ 3 , i = 1 , 2 , … , n ) , there is a set of s ( 1 ≤ s ≤ κ ( G ( m 1 , m 2 , … , m n ) ) ) internally node-disjoint x , y -paths whose union covers every vertex in G ( m 1 , m 2 , … , m n ) , where κ ( G ( m 1 , m 2 , … , m n ) ) denotes the connectivity of G ( m 1 , m 2 , … , m n ) . Our results, in some sense, extended a previous result in Shih and Kao (2011) [23] .

Authors

Institutions

Publication Details

Journal
Theoretical Computer Science
Published
2024-12-20
DOI
https://doi.org/10.1016/j.tcs.2024.115038
Citations
1
Primary Topic
Interconnection Networks and Systems
Type
article
Field-Weighted Citation Impact
0.35

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Super spanning connectivity of the generalized hypercube network

Eminjan Sabir, Xiaoqian Wang
1 citations
Theoretical Computer Science
Interconnection Networks and Systems
0.35
article

Super spanning connectivity of the generalized hypercube network

Eminjan Sabir, Xiaoqian Wang
article en
1 citations

Abstract

The generalized hypercube G ( m 1 , m 2 , … , m n ) is one of the key interconnection networks with attractive topological properties. In this paper, we focus our attention on the super spanning connectivity of G ( m 1 , m 2 , … , m n ) . We show that for a pair of arbitrary nodes x and y in G ( m 1 , m 2 , … , m n ) ( m i ≥ 3 , i = 1 , 2 , … , n ) , there is a set of s ( 1 ≤ s ≤ κ ( G ( m 1 , m 2 , … , m n ) ) ) internally node-disjoint x , y -paths whose union covers every vertex in G ( m 1 , m 2 , … , m n ) , where κ ( G ( m 1 , m 2 , … , m n ) ) denotes the connectivity of G ( m 1 , m 2 , … , m n ) . Our results, in some sense, extended a previous result in Shih and Kao (2011) [23] .

Theoretical Computer ScienceVol. 1029
Xinjiang University (CN)
National Natural Science Foundation of China
Affordable and clean energy
Openalex Percentile: Top 35%
Interconnection Networks and Systems
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.