On the global strong resilience of fault Hamiltonian graphs

Huiqing Liu, Ruiting Zhang and Shunzhe Zhang

Applied Mathematics and Computation, 2022, vol. 418, issue C

Abstract: The global strong resilience of G with respect to having a fractional perfect matching, also called FSMP number of G, is the minimum number of edges (or resp., edges and/or vertices) whose deletion results in a graph that has no fractional perfect matchings. A graph G is said to be f-fault Hamiltonian if there exists a Hamiltonian cycle in G−F for any set F of edges and/or vertices with |F|≤f. In this paper, we first give a sufficient condition, involving the independent number, to determine the FSMP number of (δ−2)-fault Hamiltonian graphs with minimum degree δ≥2, and then we can derive the FSMP number of some networks, which generalize some known results.

Keywords: Global strong resilience; Fault Hamiltonian graph; Fractional perfect matching; Independent number (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321009243
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:418:y:2022:i:c:s0096300321009243

DOI: 10.1016/j.amc.2021.126841

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