One-to-many node-disjoint paths in \((n,k)\)-star graphs
From MaRDI portal
Publication:968113
DOI10.1016/j.dam.2009.08.013zbMath1226.05239OpenAlexW2118797705MaRDI QIDQ968113
Yonghong Xiang, Iain A. Stewart
Publication date: 5 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.08.013
Network design and communication in computer systems (68M10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (9)
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 ⋮ Vertex-disjoint paths in a 3-ary \(n\)-cube with faulty vertices ⋮ On the construction of all shortest node-disjoint paths in star networks ⋮ The conditional fault diagnosability of \((n, k)\)-star graphs ⋮ On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups ⋮ Maximum independent sets partition of \((n, k)\)-star graphs ⋮ Resistance distances in Cayley graphs on symmetric groups
Cites Work
- Unnamed Item
- Unnamed Item
- Node-to-set disjoint paths problem in star graphs
- Fault-tolerant routing in circulant networks and cycle prefix networks
- The \((n,k)\)-star graph: A generalized star graph
- From Hall's matching theorem to optimal routing on hypercubes
- Constructing vertex-disjoint paths in \((n, k)\)-star graphs
- Generalized Hypercube and Hyperbus Structures for a Computer Network
- Efficient dispersal of information for security, load balancing, and fault tolerance
- Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
- Constructing one-to-many disjoint paths in folded hypercubes
- Computing and Combinatorics
- TOPOLOGICAL PROPERTIES OF THE (n,k)-STAR GRAPH
- THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS
This page was built for publication: One-to-many node-disjoint paths in \((n,k)\)-star graphs
