首页|On the global strong resilience of fault Hamiltonian graphs
On the global strong resilience of fault Hamiltonian graphs
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
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 |& nbsp;F | <= f. In this paper, we first give a sufficient condition, involving the independent number, to determine the FSMP number of (delta - 2)-fault Hamiltonian graphs with minimum degree delta >= 2 , and then we can derive the FSMP number of some networks, which generalize some known results. (c) 2021 Elsevier Inc. All rights reserved.
Global strong resilienceFault Hamiltonian graphFractional perfect matchingIndependent numberFRACTIONAL MATCHING PRECLUSIONHYPERCUBE
NSTL
Elsevier
