Component Edge Connectivity of Hypercubes

DOI10.1142/S012905411850017XzbMath1398.68058OpenAlexW2895223547MaRDI QIDQ4963263

Weihua Yang, Shurong Zhang, Li Qiong Xu, Shu-Li Zhao

Publication date: 1 November 2018

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s012905411850017x

zbMATH Keywords

hypercubenetworksfault-tolerancecomponent edge connectivitycomponent connectivity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)

Related Items (11)

Matroidal connectivity and conditional matroidal connectivity of star graphs ⋮ Link fault tolerance of BC networks and folded hypercubes on \(h\)-extra \(r\)-component edge-connectivity ⋮ The component (edge) connectivity of shuffle-cubes ⋮ The Component (Edge) Connectivity of Round Matching Composition Networks ⋮ Reliability measure of multiprocessor system based on enhanced hypercubes ⋮ Characterizations of optimal component cuts of locally twisted cubes ⋮ Reliability assessment of the Cayley graph generated by trees ⋮ Conditional edge connectivity of the locally twisted cubes ⋮ Relationship between extra edge connectivity and component edge connectivity for regular graphs ⋮ Communication Performance Evaluation of the Locally Twisted Cube ⋮ Component edge connectivity of hypercube-like networks

Cites Work

• Unnamed Item
• Unnamed Item
• Decomposing the hypercube \(Q_n\) into \(n\) isomorphic edge-disjoint trees
• Generalized measures of fault tolerance in hypercube networks
• Hamiltonian cycles in hypercubes with faulty edges
• On \(g\)-extra connectivity of folded hypercubes
• On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks
• Counting hypercubes in hypercubes
• On reliability of the folded hypercubes
• Extraconnectivity of hypercubes
• Bounding the size of square-free subgraphs of the hypercube
• Bounding the size of the subgraph induced by \(m\) vertices and extra edge-connectivity of hypercubes
• The spanning laceability on the faulty bipartite hypercube-like networks
• Linearly many faults in Cayley graphs generated by transposition trees
• A note on short cycles in a hypercube
• Component connectivity of the hypercubes
• Linearly many faults in 2-tree-generated networks

This page was built for publication: Component Edge Connectivity of Hypercubes