The preclusion numbers and edge preclusion numbers in a class of Cayley graphs
From MaRDI portal
Publication:777422
DOI10.1016/J.DAM.2020.04.010zbMath1443.05096OpenAlexW3018650918MaRDI QIDQ777422
Publication date: 7 July 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.04.010
Related Items (1)
Cites Work
- Embedding longest fault-free paths onto star graphs with more vertex faults
- Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes with faulty elements
- Fault tolerance in \(k\)-ary \(n\)-cube networks
- Fault tolerance in bubble-sort graph networks
- A note on edge fault tolerance with respect to hypercubes
- A study of fault tolerance in star graph
- Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
- Improving bounds on link failure tolerance of the star graph
- Fault-free longest paths in star networks with conditional link faults
- How robust is the n-cube?
- Subnetwork preclusion for bubble-sort networks
- Fault tolerance in the arrangement graphs
- Robustness of star graph network under link failure
- Conditional fault tolerance in a class of Cayley graphs
- A group-theoretic model for symmetric interconnection networks
- On the Existence of Hamiltonian Circuits in Faulty Hypercubes
- Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
- Link Failure Tolerance in the Arrangement Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The preclusion numbers and edge preclusion numbers in a class of Cayley graphs