On complexity of substructure connectivity and restricted connectivity of graphs
- 5 February 2026
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 211
Abstract
No abstract availableFunding Information
- Natural Science Foundation of Qinghai Province (2025-ZJ-902T)
- National Natural Science Foundation of China (11801061)
- National Natural Science Foundation of China (12261071)
This publication has 19 references indexed in Scilit:
- Structure connectivity and substructure connectivity of split-star networksDiscrete Applied Mathematics, 2023
- Structure and Substructure Connectivity of Balanced HypercubesBulletin of the Malaysian Mathematical Sciences Society, 2019
- The 4-component connectivity of alternating group networksTheoretical Computer Science, 2019
- The vertex
k
-cut problemDiscrete Optimization, 2019
- Structure fault tolerance of hypercubes and folded hypercubesTheoretical Computer Science, 2018
- On the complexity of computing the k-restricted edge-connectivity of a graphTheoretical Computer Science, 2017
- Conditional connectivity of Cayley graphs generated by transposition treesInformation Processing Letters, 2010
- On the extraconnectivity of graphsDiscrete Mathematics, 1996
- Extraconnectivity of graphs with large girthDiscrete Mathematics, 1994
- On computing a conditional edge-connectivity of a graphInformation Processing Letters, 1988