The spanning connectivity of folded hypercubes

DOI10.1016/j.ins.2010.05.015zbMath1205.68046OpenAlexW2060470106MaRDI QIDQ991888

Meijie Ma

Publication date: 8 September 2010

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2010.05.015

zbMATH Keywords

interconnection networkspanning connectivityfolded hypercubespanning laceability

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Polynomially determining spanning connectivity of locally connected line graphs, Link fault tolerance of BC networks and folded hypercubes on \(h\)-extra \(r\)-component edge-connectivity, Fault tolerance of hypercube like networks: spanning laceability under edge faults, An efficient construction of one-to-many node-disjoint paths in folded hypercubes, Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph, One-to-one disjoint path covers on alternating group graphs, Unnamed Item, Construction of optimal independent spanning trees on folded hypercubes, THE SUPER SPANNING CONNECTIVITY AND SUPER SPANNING LACEABILITY OF TORI WITH FAULTY ELEMENTS, Many-to-many disjoint paths in hypercubes with faulty vertices, One-to-one disjoint path covers on multi-dimensional tori

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The super connectivity of the pancake graphs and the super laceability of the star graphs
• Many-to-many disjoint paths in faulty hypercubes
• The super laceability of the hypercubes
• On the spanning connectivity of graphs
• Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position
• 1-vertex-fault-tolerant cycles embedding on folded hypercubes
• Some results on topological properties of folded hypercubes
• On the spanning connectivity and spanning laceability of hypercube-like networks
• Edge-fault-tolerant bipanconnectivity of hypercubes
• On the spanning fan-connectivity of graphs
• Generalized diameters and Rabin numbers of networks
• The vulnerability of the diameter of folded \(n\)-cubes
• Forwarding indices of folded \(n\)-cubes
• Embedding Hamiltonian cycles into folded hypercubes with faulty links
• The super-connected property of recursive circulant graphs
• On spanning connected graphs
• Cycles in folded hypercubes
• A group-theoretic model for symmetric interconnection networks
• Constructing one-to-many disjoint paths in folded hypercubes
• THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS
• Some edge‐fault‐tolerant properties of the folded hypercube