Structure connectivity and substructure connectivity of hypercubes

The connectivity of a network – the minimum number of nodes whose removal will disconnect the network – is directly related to its reliability and fault tolerability, hence an important indicator of the network's robustness. In this paper, we extend the notion of connectivity by introducing two...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 634; s. 97 - 107
Hlavní autoři: Lin, Cheng-Kuan, Zhang, Lili, Fan, Jianxi, Wang, Dajin
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 27.06.2016
Témata:
Disengaging
Faults
Graphs
Hypercube
Hypercubes
Indicators
Networks
Robustness
Structure connectivity
Substructure connectivity
Substructures
Substructure connectivity
Structure connectivity
Hypercube
ISSN:0304-3975, 1879-2294
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The connectivity of a network – the minimum number of nodes whose removal will disconnect the network – is directly related to its reliability and fault tolerability, hence an important indicator of the network's robustness. In this paper, we extend the notion of connectivity by introducing two new kinds of connectivity, called structure connectivity and substructure connectivity, respectively. Let H be a certain particular connected subgraph of G. The H-structure connectivity of graph G, denoted κ(G;H), is the cardinality of a minimal set of subgraphs F={H1′,H2′,…,Hm′} in G, such that every Hi′∈F is isomorphic to H, and F's removal will disconnect G. The H-substructure connectivity of graph G, denoted κs(G;H), is the cardinality of a minimal set of subgraphs F={J1,J2,…,Jm}, such that every Ji∈F is a connected subgraph of H, and F's removal will disconnect G. In this paper, we will establish both κ(Qn;H) and κs(Qn;H) for the hypercube Qn and H∈{K1,K1,1,K1,2,K1,3,C4}.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2016.04.014