Subnetwork Preclusion of (n,k)-Star Networks
From MaRDI portal
Publication:6169936
DOI10.1142/s0129054122500095zbMath1518.68261OpenAlexW4223931775MaRDI QIDQ6169936
Publication date: 15 August 2023
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054122500095
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- Unnamed Item
- Unnamed Item
- Fault-tolerance of \((n, k)\)-star networks
- Fault tolerance in \(k\)-ary \(n\)-cube networks
- Fault tolerance in bubble-sort graph networks
- The preclusion numbers and edge preclusion numbers in a class of Cayley graphs
- A study of fault tolerance in star graph
- Strong matching preclusion of \((n,k)\)-star graphs
- Weak-vertex-pancyclicity of (\(n,k\))-star graphs
- Improving bounds on link failure tolerance of the star graph
- The \((n,k)\)-star graph: A generalized star graph
- Length two path centered surface areas of the \((n, k)\)-star graph
- Subnetwork preclusion for bubble-sort networks
- Fault tolerance in the arrangement graphs
- Robustness of star graph network under link failure
- Conditional fault tolerance in a class of Cayley graphs
- On 3-Extra Connectivity and 3-Extra Edge Connectivity of Folded Hypercubes
This page was built for publication: Subnetwork Preclusion of (n,k)-Star Networks