Hamiltonian-laceability of star graphs
From MaRDI portal
Publication:4761322
DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0037(200012)36:4<225::AID-NET3>3.0.CO;2-G" /><225::AID-NET3>3.0.CO;2-G 10.1002/1097-0037(200012)36:4<225::AID-NET3>3.0.CO;2-GzbMath0968.05051OpenAlexW1999212995MaRDI QIDQ4761322
Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho
Publication date: 11 February 2001
Full work available at URL: https://doi.org/10.1002/1097-0037(200012)36:4<225::aid-net3>3.0.co;2-g
Related Items (51)
Cycle embedding in star graphs with conditional edge faults ⋮ Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges ⋮ On the edge-hyper-Hamiltonian laceability of balanced hypercubes ⋮ Edge-disjoint paths in faulty augmented cubes ⋮ Hamiltonian laceability of bubble-sort graphs with edge faults ⋮ Paired many-to-many disjoint path covers in faulty hypercubes ⋮ Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes ⋮ Star transposition Gray codes for multiset permutations ⋮ Random induced subgraphs of Cayley graphs induced by transpositions ⋮ Fault tolerance of hypercube like networks: spanning laceability under edge faults ⋮ Hamiltonian cycles of balanced hypercube with more faulty edges ⋮ The spanning cyclability of Cayley graphs generated by transposition trees ⋮ A note on cycle embedding in hypercubes with faulty vertices ⋮ Cycle embedding in star graphs with more conditional faulty edges ⋮ Worst-case efficient dominating sets in digraphs ⋮ Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs ⋮ Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees ⋮ Edge-bipancyclicity of star graphs with faulty elements ⋮ Substar reliability analysis in star networks ⋮ Mutually independent Hamiltonian connectivity of \((n,k)\)-star graphs ⋮ Hamiltonian cycles and paths in faulty twisted hypercubes ⋮ Fault-free mutually independent Hamiltonian cycles of faulty star graphs ⋮ Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes ⋮ Pancyclicity and bipancyclicity of folded hypercubes with both vertex and edge faults ⋮ Edge-bipancyclicity of a hypercube with faulty vertices and edges ⋮ Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity ⋮ Fault-tolerant Hamiltonian laceability of balanced hypercubes ⋮ Hamiltonian properties of twisted hypercube-like networks with more faulty elements ⋮ 1-vertex-fault-tolerant cycles embedding on folded hypercubes ⋮ Finding cycles in hierarchical hypercube networks ⋮ Some results on topological properties of folded hypercubes ⋮ Hyper Hamiltonian laceability on edge fault star graph ⋮ Embedding longest fault-free paths onto star graphs with more vertex faults ⋮ The super connectivity of the pancake graphs and the super laceability of the star graphs ⋮ Embedding cycles of various lengths into star graphs with both edge and vertex faults ⋮ Disjoint Hamilton cycles in the star graph ⋮ Pancyclicity and bipancyclicity of conditional faulty folded hypercubes ⋮ Every edge lies on cycles embedding in folded hypercubes with both vertex and edge faults ⋮ Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults ⋮ Path embedding in star graphs ⋮ Fault-free longest paths in star networks with conditional link faults ⋮ Long paths in hypercubes with conditional node-faults ⋮ Fault-tolerant cycles embedding in folded hypercubes ⋮ Linear array and ring embeddings in conditional faulty hypercubes ⋮ Survey on path and cycle embedding in some networks ⋮ Mutually independent Hamiltonian cycles for the pancake graphs and the star graphs ⋮ Star graph automorphisms and disjoint Hamilton cycles ⋮ Fault-tolerant Hamiltonian laceability of hypercubes. ⋮ Unnamed Item ⋮ Every edge lies on cycles embedding in folded hypercubes with vertex-fault-tolerant ⋮ Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees
Cites Work
This page was built for publication: Hamiltonian-laceability of star graphs
