Increasing the connectivity of the star graphs

DOI10.1002/NET.10045MaRDI QIDQ4785232zbMATH OpenOpenAlexFDO

Authors Eddie Cheng, Marc J. Lipman

Publication date 17 December 2002

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.10045

Mathematics Subject Classification ID

Connectivity (05C40) Structural characterization of families of graphs (05C75)

Recommendations

• Linearly many faults in \((n,k)\)-star graphs
• Structure connectivity and substructure connectivity of star graphs
• Maximal vertex-connectivity of
• Generalized measures for fault tolerance of star networks
• Embedded connectivity of \( (n, k)\)-star graphs

Cited in

(28)

• Conditional fault diagnosis of hierarchical hypercubes
• On the problem of determining which \((n, k)\)-star graphs are Cayley graphs
• The 1-good neighbor connectivity of unidirectional star graph networks
• Fault diagnosability of arrangement graphs
• Increasing the connectivity of split-stars
• Conditional diagnosability of alternating group networks
• Fault-Tolerance of Star Graph Based on Subgraph Fault Pattern
• Strong structural properties of unidirectional star graphs
• The extra connectivity of bubble-sort star graphs
• Augmenting chains in graphs without a skew star.
• Conditional fault tolerance of arrangement graphs
• Maximal vertex-connectivity of
• Characterization of component diagnosability of regular networks
• Linearly many faults in Cayley graphs generated by transposition trees
• Fault resiliency of Cayley graphs generated by transpositions
• Conditional fault diagnosability of dual-cubes
• Linearly many faults in arrangement graphs
• Note on reliability of star graphs
• Linearly many faults in Cayley graphs generated by transposition triangle free unicyclic graphs
• Relationship between extra edge connectivity and component edge connectivity for regular graphs
• On component connectivity of hierarchical star networks
• The generalized 4-connectivity of hypercubes
• Cyclic connectivity of star graph
• Matching preclusion and conditional matching preclusion for bipartite interconnection networks. II: Cayley graphs generated by transposition trees and hyper-stars
• A new approach to finding the extra connectivity of graphs
• On reliability of the folded hypercubes in terms of the extra edge-connectivity
• Linearly many faults in \((n,k)\)-star graphs
• Linearly many faults in 2-tree-generated networks

This page was built for publication: Increasing the connectivity of the star graphs

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