Hamiltonian connectivity of the WK-recursive network with faulty nodes

DOI10.1016/J.INS.2008.02.011zbMATH Open1183.68097OpenAlexW2076975224MaRDI QIDQ1031676FDOQ1031676

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

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

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)

Cites Work

• Title not available (Why is that?)
• On embedding cycles into faulty twisted cubes
• Title not available (Why is that?)
• Longest fault-free paths in hypercubes with vertex faults
• Generalized diameters and Rabin numbers of networks
• Title not available (Why is that?)
• Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
• An adaptive routing algorithm for WK-recursive topologies
• Proof that pyramid networks are 1-Hamiltonian-connected with high probability
• Broadcasting on incomplete WK-recursive networks
• Node-disjoint paths in incomplete WK-recursive networks
• 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
• Generalized power domination: propagation radius and Sierpiński graphs
• A survey and classification of Sierpiński-type 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)