On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks

DOI10.1016/j.amc.2010.07.073zbMath1200.90042MaRDI QIDQ606827

Jianping Ou

Publication date: 18 November 2010

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

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

zbMATH Keywords

network reliability; edge connectivity; hypercube network

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

05C90: Applications of graph theory

90B18: Communication networks in operations research

Related Items

Component Edge Connectivity of Hypercubes, Reliability analysis and fault tolerance for hypercube multi-computer networks, Bounding the size of the subgraph induced by \(m\) vertices and extra edge-connectivity of hypercubes, Onm-restricted edge connectivity of undirected generalized De Bruijn graphs, On restricted edge-connectivity of lexicographic product graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• On 3-restricted edge connectivity of undirected binary Kautz graphs
• Minimally 3-restricted edge connected graphs
• On computing a conditional edge-connectivity of a graph
• Extraconnectivity of graphs with large girth
• Edge-cuts leaving components of order at least three
• Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
• Restricted connectivity for three families of interconnection networks
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• Edge cuts leaving components of order at least \(m\)
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Combinatorial optimization problems in the analysis and design of probabilistic networks
• Sufficient conditions for λ′‐optimality in graphs with girth g
• Reliable circuits using less reliable relays
• On restricted edge-connectivity of graphs.