Hamiltonian connectivity of the WK-recursive network with faulty nodes

DOI10.1016/J.INS.2008.02.011MaRDI QIDQ1031676zbMATH OpenOpenAlexFDO

Authors 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 embeddingHamiltonian-connectedWK-recursivegraph-theoretic interconnection network

Mathematics Subject Classification ID

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

Recommendations

• Fault-tolerant Hamiltonian connectivity of the WK-recursive networks
• Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes
• Super spanning connectivity on WK-recursive networks
• Topological properties of incomplete WK-recursive networks
• Hamiltonian connectivity of restricted hypercube-like networks under the conditional fault model

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 194437 (Why is no real title available?)
• scientific article; zbMATH DE number 870411 (Why is no real title available?)
• An adaptive routing algorithm for WK-recursive topologies
• Broadcasting on incomplete WK-recursive networks
• Generalized diameters and Rabin numbers of networks
• Longest fault-free paths in hypercubes with vertex faults
• Node-disjoint paths in incomplete WK-recursive networks
• On embedding cycles into faulty twisted cubes
• Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
• Proof that pyramid networks are 1-Hamiltonian-connected with high probability
• Topological properties of incomplete WK-recursive networks

Cited in

(22)

• Fault Hamiltonicity and fault Hamiltonian-connectivity of generalised matching networks
• Fault-tolerant Hamiltonian connectivity of the WK-recursive networks
• Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
• Conditional edge-fault Hamiltonicity of augmented cubes
• A survey and classification of Sierpiński-type graphs
• Generalized power domination: propagation radius and Sierpiński graphs
• Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
• The Hamiltonian connectivity of rectangular supergrid graphs
• Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes
• Shortest paths in Sierpiński graphs
• Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks
• The triangular pyramid: Routing and topological properties
• The m-pancycle-connectivity of a WK-recursive network
• On some bounds of the topological indices of generalized Sierpiński and extended Sierpiński graphs
• Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes
• Proof that pyramid networks are 1-Hamiltonian-connected with high probability
• Node-disjoint paths in incomplete WK-recursive networks
• Structural properties of subdivided-line graphs
• Super spanning connectivity on WK-recursive networks
• On vertex-pancyclicity and edge-pancyclicity of the WK-recursive network
• Various cycles embedding in faulty balanced hypercubes
• Two-node-Hamiltonicity of enhanced pyramid networks

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

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