THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS
From MaRDI portal
Publication:5291305
DOI10.1142/S0129054106003905zbMath1103.68097MaRDI QIDQ5291305
Hua-Min Hung, Cheng-Kuan Lin, Hong-Chun Hsu, Lih-Hsing Hsu
Publication date: 10 May 2006
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Related Items (20)
Fault-tolerance of \((n, k)\)-star networks ⋮ A kind of conditional fault tolerance of \((n, k)\)-star graphs ⋮ \((n-3)\)-edge-fault-tolerant weak-pancyclicity of \((n,k)\)-star graphs ⋮ The \(3^{*}\)-connected property of pyramid networks ⋮ Fault tolerance of hypercube like networks: spanning laceability under edge faults ⋮ Conditional fault-tolerant routing of (n,k)-star graphs ⋮ One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes ⋮ On the spanning connectivity of tournaments ⋮ The conditional fault diagnosability of \((n, k)\)-star graphs ⋮ Weak-vertex-pancyclicity of (\(n,k\))-star graphs ⋮ The Super Spanning Connectivity of Arrangement Graphs ⋮ THE SUPER SPANNING CONNECTIVITY AND SUPER SPANNING LACEABILITY OF TORI WITH FAULTY ELEMENTS ⋮ Constructing vertex-disjoint paths in \((n, k)\)-star graphs ⋮ One-to-many node-disjoint paths in \((n,k)\)-star graphs ⋮ The spanning connectivity of folded hypercubes ⋮ On the spanning connectivity and spanning laceability of hypercube-like networks ⋮ Globally bi-3*-connected graphs ⋮ On the spanning fan-connectivity of graphs ⋮ Maximum independent sets partition of \((n, k)\)-star graphs ⋮ One-to-one disjoint path covers on multi-dimensional tori
Cites Work
This page was built for publication: THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS