Increasing the connectivity of the star graphs
From MaRDI portal
Publication:4785232
DOI10.1002/net.10045zbMath1018.05055OpenAlexW2107287052MaRDI QIDQ4785232
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
Related Items (23)
On the problem of determining which \((n, k)\)-star graphs are Cayley graphs ⋮ CYCLIC CONNECTIVITY OF STAR GRAPH ⋮ LINEARLY MANY FAULTS IN (n, k)-STAR GRAPHS ⋮ 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 ⋮ Linearly many faults in arrangement graphs ⋮ Note on reliability of star graphs ⋮ Fault-Tolerance of Star Graph Based on Subgraph Fault Pattern ⋮ Conditional fault tolerance of arrangement graphs ⋮ Linearly many faults in Cayley graphs generated by transposition triangle free unicyclic graphs ⋮ Conditional diagnosability of alternating group networks ⋮ Linearly many faults in Cayley graphs generated by transposition trees ⋮ The 1-good neighbor connectivity of unidirectional star graph networks ⋮ Fault diagnosability of arrangement graphs ⋮ Conditional fault diagnosis of hierarchical hypercubes ⋮ The generalized 4-connectivity of hypercubes ⋮ Linearly many faults in 2-tree-generated networks ⋮ On reliability of the folded hypercubes in terms of the extra edge-connectivity ⋮ FAULT RESILIENCY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITIONS ⋮ On Component Connectivity of Hierarchical Star Networks ⋮ CONDITIONAL FAULT DIAGNOSABILITY OF DUAL-CUBES ⋮ Characterization of component diagnosability of regular networks ⋮ Relationship between extra edge connectivity and component edge connectivity for regular graphs
This page was built for publication: Increasing the connectivity of the star graphs
