Embedding cycles of various lengths into star graphs with both edge and vertex faults

DOI10.1016/J.AMC.2010.05.038zbMath1231.05153OpenAlexW2032136382MaRDI QIDQ988635

Ming-Chien Yang

Publication date: 18 August 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2010.05.038

zbMATH Keywords

cycleembeddingpathinterconnection networksstar graphfault-tolerant

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Pancyclicity of \(k\)-ary \(n\)-cube networks with faulty vertices and edges

Cites Work

• Unnamed Item
• Embedding longest fault-free paths onto star graphs with more vertex faults
• Hyper Hamiltonian laceability on edge fault star graph
• Edge-bipancyclicity of star graphs under edge-fault tolerant
• Edge-bipancyclicity of a hypercube with faulty vertices and edges
• Path embedding in star graphs
• On the fault-diameter of the star graph
• Cycle embedding in star graphs with edge faults
• A group-theoretic model for symmetric interconnection networks
• Hamiltonian-laceability of star graphs
• Longest fault-free paths in star graphs with vertex faults

This page was built for publication: Embedding cycles of various lengths into star graphs with both edge and vertex faults