The largest component of faulty star graphs
From MaRDI portal
Publication:2182327
DOI10.1016/j.tcs.2020.04.012zbMath1448.05118OpenAlexW3023235943MaRDI QIDQ2182327
Publication date: 23 May 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.04.012
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distance in graphs (05C12) Connectivity (05C40)
Related Items
Vulnerability analysis of multiprocessor system based on burnt pancake networks, The (E)FTSM-(edge) Connectivity of Cayley Graphs Generated by Transposition Trees, A note on the conditional fault-tolerant strong Menger edge connectivity of regular graphs
Cites Work
- \(\{2,3\}\)-extraconnectivities of hypercube-like networks
- Extraconnectivity of \(k\)-ary \(n\)-cube networks
- Cycle embedding in star graphs with conditional edge faults
- Strong Menger connectivity with conditional faults on the class of hypercube-like networks
- A kind of conditional vertex connectivity of star graphs
- On the fault-diameter of the star graph
- Extraconnectivity of graphs with large girth
- Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks
- Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes
- Edge disjoint paths in hypercubes and folded hypercubes with conditional faults
- Edge-fault-tolerant strong Menger edge connectivity on the class of hypercube-like networks
- Conditional (edge-)fault-tolerant strong Menger (edge) connectivity of folded hypercubes
- The \(t/k\)-diagnosability and strong Menger connectivity on star graphs with conditional faults
- On \(g\)-extra connectivity of hypercube-like networks
- 3-extra connectivity of 3-ary \(n\)-cube networks
- Robustness of star graph network under link failure
- Cycle embedding in star graphs with edge faults
- The $t/k$-Diagnosability of Star Graph Networks
- On the maximal connected component of a hypercube with faulty vertices III
- Largest connected component of a star graph with faulty vertices
- A group-theoretic model for symmetric interconnection networks
- On the maximal connected component of hypercube with faulty vertices (II)
- On the maximal connected component of hypercube with faulty vertices
- On 3-Extra Connectivity and 3-Extra Edge Connectivity of Folded Hypercubes
- On extra connectivity and extra edge-connectivity of balanced hypercubes
- Longest fault-free paths in star graphs with vertex faults
