Super spanning connectivity of the generalized hypercube network
From MaRDI portal
Cites work
- A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices
- An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs
- An efficient algorithm to construct disjoint path covers of DCell networks
- Combinatorial properties of generalized hypercube graphs
- Conditional diagnosability of hypermesh optical multiprocessor systems under the PMC model
- Conditional diagnosability of hypermeshes under the comparison model
- Generalized Hypercube and Hyperbus Structures for a Computer Network
- Graph theory
- Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
- On the spanning connectivity and spanning laceability of hypercube-like networks
- One-to-one disjoint path covers on k-ary n-cubes
- One-to-one disjoint path covers on alternating group graphs
- One-to-one disjoint path covers on multi-dimensional tori
- Super spanning connectivity of split-star networks
- Super spanning connectivity on WK-recursive networks
- THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS
- The \(h\)-restricted connectivity of the generalized hypercubes
- The super connectivity of the pancake graphs and the super laceability of the star graphs
- The super laceability of the hypercubes
- The super spanning connectivity of arrangement graphs
- The two-equal-disjoint path cover problem of matching composition network
- Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube
This page was built for publication: Super spanning connectivity of the generalized hypercube network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7033932)
