Star fault tolerance of hypercube
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.
|ESI Research Field|
Cited Times [WOS]:0
|Document Type||Journal Article|
Engineering College,Southern University of Science and Technology,Shenzhen,518000,China
|First Author Affilication||Southern University of Science and Technology|
|First Author's First Affilication||Southern University of Science and Technology|
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).
|Files in This Item:||There are no files associated with this item.|
|Recommend this item|
|Export to Endnote|
|Export to Excel|
|Export to Csv|
|Similar articles in Google Scholar|
|Similar articles in Baidu Scholar|
|Similar articles in Bing Scholar|
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.