\((n-3)\)-edge-fault-tolerant weak-pancyclicity of \((n,k)\)-star graphs
From MaRDI portal
Publication:385956
DOI10.1016/j.tcs.2013.11.013zbMath1277.68221OpenAlexW122310638MaRDI QIDQ385956
Tzu-Lung Chen, Dyi-Rong Duh, Yue-Li Wang
Publication date: 13 December 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.11.013
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (6)
On the problem of determining which \((n, k)\)-star graphs are Cayley graphs ⋮ Fault-tolerance of \((n, k)\)-star networks ⋮ Conditional fault-tolerant routing of (n,k)-star graphs ⋮ A complete classification of which \((n,k)\)-star graphs are Cayley graphs ⋮ Odd cycles embedding on folded hypercubes with conditional faulty edges ⋮ Maximum independent sets partition of \((n, k)\)-star graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Node-pancyclicity and edge-pancyclicity of crossed cubes
- Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
- Edge-bipancyclicity of star graphs under edge-fault tolerant
- Weak-vertex-pancyclicity of (\(n,k\))-star graphs
- Embedding of cycles in twisted cubes with edge-pancyclic
- Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
- Edge-pancyclicity of Möbius cubes
- Cycles in bipartite tournaments
- The \((n,k)\)-star graph: A generalized star graph
- Geodesic-pancyclic graphs
- Constructing vertex-disjoint paths in \((n, k)\)-star graphs
- Pancyclic graphs. I
- Cycle embedding in star graphs with edge faults
- Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
- Some recent results in hamiltonian graphs
- Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
- TOPOLOGICAL PROPERTIES OF THE (n,k)-STAR GRAPH
- THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS
- On Subtournaments of a Tournament
- The Theory of Round Robin Tournaments
This page was built for publication: \((n-3)\)-edge-fault-tolerant weak-pancyclicity of \((n,k)\)-star graphs