Star fault tolerance of hypercube

Pan，Kaige

2023-09-13

10.1016/j.tcs.2023.114052

Theoretical Computer Science   Impact Factor & Quartile

0304-3975

In this paper, first we estimate the star conditional connectivity of Hypercube, where the star conditional connectivity is the minimum number of stars in a graph, such that the deletion of those stars disconnects the graph and the left graph has property P. Second, a graph is called strongly Menger connected if for any two vertices u,v in the graph, there are min(d(u),d(v)) internally disjoint paths between them, where d(u),d(v) are the degree of u,v in the graph. In this paper, we propose k-star-fault-tolerance strong Menger connectivity. A graph is called k-star-fault-tolerance strong Menger connected if after the removal of no more that k stars, the left graph remains strongly Menger connected. We show that Hypercube Q is [Formula presented]-star-fault-tolerance strongly Menger connected. Moreover, the bound is sharp.

Conditional connectivity Star fault tolerance Strong Menger connectivity Structure connectivity

English

First

COMPUTER SCIENCE

2-s2.0-85166347599

Scopus

Engineering College,Southern University of Science and Technology,Shenzhen,518000,China

Pan，Kaige. Star fault tolerance of hypercube[J]. Theoretical Computer Science,2023,972.

Pan，Kaige.(2023).Star fault tolerance of hypercube.Theoretical Computer Science,972.

Pan，Kaige."Star fault tolerance of hypercube".Theoretical Computer Science 972(2023).