Largest connected component of a star graph with faulty vertices
From MaRDI portal
(Redirected from Publication:3545669)
Recommendations
Cites work
- A \((4n - 9)/3\) diagnosis algorithm on \(n\)-dimensional cube network
- A faster algorithm for solving linear algebraic equations on the star graph.
- A grid embedding into the star graph for image analysis solutions
- A group-theoretic model for symmetric interconnection networks
- A parallel algorithm for Lagrange interpolation on the star graph
- Cycle embedding in star graphs with edge faults
- Embedding complete binary trees into star and Pancake graphs
- Embedding meshes on the star graph
- Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry
- Longest fault-free paths in star graphs with vertex faults
- Node-ranking schemes for the star networks.
- On the maximal connected component of a hypercube with faulty vertices III
- On the maximal connected component of hypercube with faulty vertices
- On the maximal connected component of hypercube with faulty vertices (II)
Cited in
(11)- The largest component of faulty star graphs
- Fault tolerant analysis of star networks
- The conditional fault diagnosability of (n, k)-star graphs
- scientific article; zbMATH DE number 2170426 (Why is no real title available?)
- Conditional fault diagnosis of hierarchical hypercubes
- Fault diagnosability of arrangement graphs
- On component connectivity of hierarchical star networks
- Conditional diagnosability of alternating group networks
- The 3-path-connectivity of the star graphs
- Conditional (edge) neighbor connectivity of hierarchical star networks
- Relationship between extra edge connectivity and component edge connectivity for regular graphs
This page was built for publication: Largest connected component of a star graph with faulty vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545669)