Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
From MaRDI portal
Publication:4446910
DOI10.1002/net.10096zbMath1031.05079OpenAlexW2036055324MaRDI QIDQ4446910
Jimmy J. M. Tan, Lih-Hsing Hsu, Hong-Chun Hsu, Yi-Lin Hsieh
Publication date: 3 February 2004
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.10096
Related Items (33)
On the problem of determining which \((n, k)\)-star graphs are Cayley graphs ⋮ THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS ⋮ Fault-tolerance of \((n, k)\)-star networks ⋮ Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions ⋮ Fractional Matching Preclusion for (n,k)-Star Graphs ⋮ AN ADAPTIVE HEURISTIC ALGORITHM WITH THE PROBABILISTIC SAFETY VECTOR FOR FAULT-TOLERANT ROUTING ON THE (n, k)-STAR GRAPH ⋮ A kind of conditional fault tolerance of \((n, k)\)-star graphs ⋮ \((n-3)\)-edge-fault-tolerant weak-pancyclicity of \((n,k)\)-star graphs ⋮ Embedding Wheel - like Networks ⋮ Strong matching preclusion of \((n,k)\)-star graphs ⋮ A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees ⋮ A complete classification of which \((n,k)\)-star graphs are Cayley graphs ⋮ The conditional fault diagnosability of \((n, k)\)-star graphs ⋮ Matching preclusion and conditional matching preclusion for regular interconnection networks ⋮ Weak-vertex-pancyclicity of (\(n,k\))-star graphs ⋮ Matching preclusion number in product graphs ⋮ Mutually independent Hamiltonian connectivity of \((n,k)\)-star graphs ⋮ Linearly many faults in Cayley graphs generated by transposition trees ⋮ A kind of conditional connectivity of Cayley graphs generated by wheel graphs ⋮ Constructing vertex-disjoint paths in \((n, k)\)-star graphs ⋮ Edge-fault-tolerant pancyclicity of arrangement graphs ⋮ GENERALIZED CONNECTIVITY OF (n, k)-STAR GRAPHS ⋮ One-to-many node-disjoint paths in \((n,k)\)-star graphs ⋮ Cubic planar Hamiltonian graphs of various types ⋮ Two-node-Hamiltonicity of enhanced pyramid networks ⋮ Matching preclusion for the (n, k)-bubble-sort graphs ⋮ Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks ⋮ Fault-tolerant Hamiltonian connectivity of the WK-recursive networks ⋮ Hamiltonian connectivity of 2-tree-generated networks ⋮ Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks ⋮ Maximum independent sets partition of \((n, k)\)-star graphs ⋮ Survey on path and cycle embedding in some networks ⋮ Integer \(k\)-matching preclusion of twisted cubes and \((n,s)\)-star graphs
This page was built for publication: Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
