Fault tolerance of locally twisted cubes

Litao Guo, Guifu Su, Wenshui Lin and Jinsong Chen

Applied Mathematics and Computation, 2018, vol. 334, issue C, 401-406

Abstract: Let G=(V,E) be a connected graph and P be graph-theoretic property. A network is often modeled by a graph G=(V,E). One fundamental consideration in the design of networks is reliability. The connectivity is an important parameter to measure the fault tolerance and reliability of network. The conditional connectivity λ(G, P) or κ(G, P) is the minimum cardinality of a set of edges or vertices, if it exists, whose deletion disconnects G and each remaining component has property P. Let F be a vertex set or edge set of G and P be the property of with at least k components. Then we have the k-component connectivity cκk(G) and the k-component edge connectivity cλk(G). In this paper, we determine the k-component (edge) connectivity of locally twisted cubes LTQn for small k, and we also prove other properties of LTQn.

Keywords: Interconnection networks; Fault tolerance; k-component connectivity; Conditional connectivity (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318302881
Full text for ScienceDirect subscribers only

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:eee:apmaco:v:334:y:2018:i:c:p:401-406

DOI: 10.1016/j.amc.2018.03.107

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().