Largest connected component of a star graph with faulty vertices
From MaRDI portal
Publication:3545669
DOI10.1080/00207160701619200zbMath1151.05323OpenAlexW1990536858MaRDI QIDQ3545669
Xiaofan Yang, Graham M. Megson, Yongkang Xing, Yuan Yan Tang
Publication date: 11 December 2008
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160701619200
Extremal problems in graph theory (05C35) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)
Related Items
The largest component of faulty star graphs ⋮ The conditional fault diagnosability of \((n, k)\)-star graphs ⋮ Conditional diagnosability of alternating group networks ⋮ Fault diagnosability of arrangement graphs ⋮ Conditional fault diagnosis of hierarchical hypercubes ⋮ On Component Connectivity of Hierarchical Star Networks ⋮ Relationship between extra edge connectivity and component edge connectivity for regular graphs
Cites Work
- A grid embedding into the star graph for image analysis solutions
- A parallel algorithm for Lagrange interpolation on the star graph
- A \((4n - 9)/3\) diagnosis algorithm on \(n\)-dimensional cube network
- Embedding meshes on the star graph
- Embedding complete binary trees into star and Pancake graphs
- A faster algorithm for solving linear algebraic equations on the star graph.
- Node-ranking schemes for the star networks.
- Cycle embedding in star graphs with edge faults
- On the maximal connected component of a hypercube with faulty vertices III
- 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
- Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry
- Longest fault-free paths in star graphs with vertex faults
