Structure Fault-tolerance of Arrangement Graphs

Yafei Lei and Jixiang Meng

Applied Mathematics and Computation, 2020, vol. 381, issue C

Abstract: Given a connected graph G and a connected subgraph H of G. The H-structure connectivity κ(G; H) of G is the minimal cardinality of a set of subgraphs F={J1,J2,…,Jm} in G, where Ji ≅H (1 ≤ i ≤ m), and the deletion of F disconnects G. Similarly, the H-substructure connectivity κs(G; H) of G is the minimal cardinality of a set of subgraphs F={J1,…,Jm} in G, where Ji (1 ≤ i ≤ m) is isomorphic to a connected subgraph of H, and the deletion of F disconnects G. Structure connectivity and substructure connectivity generalize the classical vertex-connectivity. In this thesis, we establish κ(An,k; H) and κs(An,k; H) of the (n, k)-arrangement graph An,k, where H∈{K1,m1,Pm2}(m1≥1,m2≥4).

Keywords: Structure connectivity; Substructure connectivity; Arrangement graphs; Paths; Stars (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320302563
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:381:y:2020:i:c:s0096300320302563

DOI: 10.1016/j.amc.2020.125287

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 ().