Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges

DOI10.1016/J.DAM.2023.02.016MaRDI QIDQ6157419zbMATH OpenOpenAlexWikidataFDO

Authors Qingying Deng, Pingshan Li, Jianguo Chen

Publication date 11 May 2023

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2023.02.016

zbMATH Keywords

Hamiltonian cycleHamiltonian pathstar graphprescribed linear forestsfault-tolerant edgesprescribed Hamiltonian laceable

Mathematics Subject Classification ID

Applications of graph theory (05C90) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Recommendations

• Conditional fault-tolerant Hamiltonicity of star graphs
• Embedding cycles of various lengths into star graphs with both edge and vertex faults
• Longest paths and cycles in faulty star graphs
• Edge-bipancyclicity of star graphs with faulty elements
• Embedding longest fault-free paths onto star graphs with more vertex faults

Cites work

• A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
• A group-theoretic model for symmetric interconnection networks
• Cycles passing through prescribed edges in a hypercube with some faulty edges
• Edge-bipancyclicity of star graphs under edge-fault tolerant
• Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes
• Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
• Fault-free Hamiltonian cycles passing through a linear forest in ternary n-cubes with faulty edges
• Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges
• Generalized measures for fault tolerance of star networks
• Hamiltonian Cycles with Prescribed Edges in Hypercubes
• Hamiltonian cycles passing through linear forests in k-ary n-cubes
• Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes
• Hamiltonian paths and cycles passing through a prescribed path in hypercubes
• Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
• Hamiltonian paths passing through prescribed edges in balanced hypercubes
• Hamiltonian paths with prescribed edges in hypercubes
• Hyper Hamiltonian laceability on edge fault star graph
• Hyper-Hamilton laceable and caterpillar-spannable product graphs
• Strong structural properties of unidirectional star graphs

Cited in

(5)

• Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links
• Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges
• Two-disjoint-cycle-cover edge/vertex bipancyclicity of star graphs
• Optimal bounds for disjoint Hamilton cycles in star graphs
• Conditional fault-tolerant Hamiltonicity of star graphs

This page was built for publication: Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges

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