The conditional fault diagnosability of (n, k)-star graphs

DOI10.1016/J.AMC.2012.03.021MaRDI QIDQ440955zbMATH OpenOpenAlexFDO

Authors Shuming Zhou

Publication date 19 August 2012

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2012.03.021

zbMATH Keywords

conditional diagnosabilityfault tolerance\((nk)\)-star graphscomparison diagnosis

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)

Recommendations

• Conditional fault diagnosability of dual-cubes
• Discrete time optimal adaptive control for linear stochastic systems
• The conditional diagnosability of crossed cubes under the comparison model
• Fault diagnosability of arrangement graphs
• Conditional fault diagnosis of hierarchical hypercubes

Cites work

• scientific article; zbMATH DE number 5139492 (Why is no real title available?)
• scientific article; zbMATH DE number 2187684 (Why is no real title available?)
• A group-theoretic model for symmetric interconnection networks
• Conditional diagnosability of alternating group networks
• Constructing vertex-disjoint paths in \((n, k)\)-star graphs
• Edge fault tolerance analysis of super \(k\)-restricted connected networks
• Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
• Fault resiliency of Cayley graphs generated by transpositions
• Generalized matching networks and their properties
• Largest connected component of a star graph with faulty vertices
• Linearly many faults in Cayley graphs generated by transposition trees
• On Fault Identification in Diagnosable Systems
• On self-diagnosable multiprocessor systems: diagnosis by the comparison approach
• 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)
• One-to-many node-disjoint paths in \((n,k)\)-star graphs
• Optimization of Reduced Dependencies for Synchronous Sequential Machines
• Super connectivity of \(k\)-regular interconnection networks
• THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS
• The (n,k)-star graph: A generalized star graph
• Topological properties of the \((n,k)\)-star graph
• Weak-vertex-pancyclicity of (\(n,k\))-star graphs

Cited in

(33)

• An approach to conditional diagnosability analysis under the PMC model and its application to torus networks
• Fractional matching preclusion for \((n,k)\)-star graphs
• Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs
• Fault-tolerance of (n, k)-star networks
• Maximum independent sets partition of \((n, k)\)-star graphs
• Discrete time optimal adaptive control for linear stochastic systems
• Fault diagnosability of arrangement graphs
• Fault tolerance and diagnosability of burnt pancake networks under the comparison model
• Conditional diagnosability of alternating group networks
• Conditional diagnosability and strong diagnosability of shuffle-cubes under the comparison model
• A survey for conditional diagnosability of alternating group networks
• On the conditional diagnosability of matching composition networks
• On conditional fault tolerance and diagnosability of hierarchical cubic networks
• The \(t/k\)-diagnosability and strong Menger connectivity on star graphs with conditional faults
• On \(g\)-good-neighbor conditional diagnosability of \((n,k)\)-star networks
• Fault diagnosability of data center networks
• Relating the extra connectivity and the conditional diagnosability of regular graphs under the comparison model
• A tree structure for local diagnosis in multiprocessor systems under the comparison model
• The \(t/k\)-diagnosability and diagnosis algorithm of pancake networks
• Conditional fault diagnosability of dual-cubes
• Researches for more reliable arrangement graphs in multiprocessor computer system
• Conditional diagnosability of arrangement graphs under the PMC model
• The conditional diagnosability of crossed cubes under the comparison model
• Measurement and algorithm for conditional local diagnosis of regular networks under the \(\mathrm{MM}^\ast\) model
• The \(h\)-edge tolerable diagnosability of balanced hypercubes
• \(G\)-good-neighbor diagnosability under the modified comparison model for multiprocessor systems
• Conditional diagnosability of multiprocessor systems based on Cayley graphs generated by transpositions
• Reliability of \((n,k)\)-star network based on \(g\)-extra conditional fault
• Conditional diagnosability of Cayley graphs generated by wheel graphs under the PMC model
• Hybrid fault diagnosis capability analysis of regular graphs
• An algorithm for conditional-fault local diagnosis of multiprocessor systems under the \(\mathrm{MM}^\ast\) model
• The \(g\)-good-neighbor diagnosability of \((n,k)\)-star graphs
• Pancake graphs: structural properties and conditional diagnosability

This page was built for publication: The conditional fault diagnosability of \((n, k)\)-star graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q440955)