The spanning connectivity of folded hypercubes

DOI10.1016/J.INS.2010.05.015MaRDI QIDQ991888zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• The spanning laceability on the faulty bipartite hypercube-like networks
• Fault tolerance of hypercube like networks: spanning laceability under edge faults
• Some edge‐fault‐tolerant properties of the folded hypercube
• Path Embedding on Folded Hypercubes
• Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes

Cites work

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

Cited in

(16)

• On the spanning connectivity and spanning laceability of hypercube-like networks
• Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph
• One-to-one disjoint path covers on multi-dimensional tori
• One-to-one disjoint path covers on alternating group graphs
• An efficient construction of one-to-many node-disjoint paths in folded hypercubes
• The super laceability of the hypercubes
• Polynomially determining spanning connectivity of locally connected line graphs
• scientific article; zbMATH DE number 7295148 (Why is no real title available?)
• Link fault tolerance of BC networks and folded hypercubes on \(h\)-extra \(r\)-component edge-connectivity
• Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
• The super spanning connectivity and super spanning laceability of tori with faulty elements
• Construction of optimal independent spanning trees on folded hypercubes
• Fault tolerance of hypercube like networks: spanning laceability under edge faults
• Some results on topological properties of folded hypercubes
• Many-to-many disjoint paths in hypercubes with faulty vertices
• One-to-one conditional path covers on augmented cubes

This page was built for publication: The spanning connectivity of folded hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991888)