Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness

DOI10.1016/S0166-218X(01)00234-7zbMath0999.05063MaRDI QIDQ1602687

Eddie Cheng, Marc J. Lipman

Publication date: 24 June 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

connectivityvulnerabilitytoughnessstar graphssplit-stars

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (14)

On the problem of determining which \((n, k)\)-star graphs are Cayley graphs ⋮ A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks ⋮ Restricted connectivity and good-neighbor diagnosability of split-star networks ⋮ The intermittent diagnosability for two families of interconnection networks under the PMC model and MM* model ⋮ Super spanning connectivity of split-star networks ⋮ Conditional diagnosability and strong diagnosability of split-star networks under the PMC model ⋮ Linearly many faults in Cayley graphs generated by transposition trees ⋮ Fault-tolerant cycle-embedding in alternating group graphs ⋮ Distance formula and shortest paths for the \((n,k)\)-star graphs ⋮ An optimal result on fault-tolerant cycle-embedding in alternating group graphs ⋮ An efficient distributed algorithm for canonical labeling on directed split-stars ⋮ Unnamed Item ⋮ Combinatorial analysis of the subsystem reliability of the split-star network ⋮ Survey on path and cycle embedding in some networks

Cites Work

• On the Day-Tripathi orientation of the star graphs: connectivity
• Recognizing tough graphs is NP-hard
• Separating from the dominant of the spanning tree polytope
• Fractional arboricity, strength, and principal partitions in graphs and matroids
• Unidirectional star graphs
• The 4-star graph is not a subgraph of any hypercube
• A faster algorithm for computing the strength of a network
• Connectivity and edge-disjoint spanning trees
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Optimal attack and reinforcement of a network
• A group-theoretic model for symmetric interconnection networks
• Fault Diagnosis in a Boolean n Cube Array of Microprocessors
• The Indirect Binary n-Cube Microprocessor Array
• A new class of interconnection networks based on the alternating group
• Connectivity of transitive graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness