Hamiltonian connectivity of the WK-recursive network with faulty nodes

DOI10.1016/j.ins.2008.02.011zbMath1183.68097OpenAlexW2076975224MaRDI QIDQ1031676

Jung-Sheng Fu

Publication date: 30 October 2009

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

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

zbMATH Keywords

fault-tolerant embeddinggraph-theoretic interconnection networkHamiltonian-connectedWK-recursive

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 (15)

Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links ⋮ Super spanning connectivity on WK-recursive networks ⋮ On vertex-pancyclicity and edge-pancyclicity of the WK-recursive network ⋮ A survey and classification of Sierpiński-type graphs ⋮ The Hamiltonian connectivity of rectangular supergrid graphs ⋮ Various cycles embedding in faulty balanced hypercubes ⋮ Generalized power domination: propagation radius and Sierpiński graphs ⋮ Structural properties of subdivided-line graphs ⋮ The triangular pyramid: Routing and topological properties ⋮ Two-node-Hamiltonicity of enhanced pyramid networks ⋮ Conditional edge-fault Hamiltonicity of augmented cubes ⋮ Pancyclicity and bipancyclicity of conditional faulty folded hypercubes ⋮ Shortest paths in Sierpiński graphs ⋮ On some bounds of the topological indices of generalized Sierpiński and extended Sierpiński graphs ⋮ Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Longest fault-free paths in hypercubes with vertex faults
• Generalized diameters and Rabin numbers of networks
• Broadcasting on incomplete WK-recursive networks
• Node-disjoint paths in incomplete WK-recursive networks
• An adaptive routing algorithm for WK-recursive topologies
• Proof that pyramid networks are 1-Hamiltonian-connected with high probability
• On embedding cycles into faulty twisted cubes
• Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
• Topological properties of incomplete WK-recursive networks

This page was built for publication: Hamiltonian connectivity of the WK-recursive network with faulty nodes