Embedded edge connectivity of k-ary n-cubes
From MaRDI portal
Publication:2680221
Recommendations
Cites work
- A group-theoretic model for symmetric interconnection networks
- Circulants and their connectivities
- Conditional connectivity of recursive interconnection networks respect to embedding restriction
- Conditional connectivity of star graph networks under embedding restriction
- Embedded connectivity of recursive networks
- Embedded connectivity of ternary \(n\)-cubes
- Fault tolerance in k-ary n-cube networks
- Graph theory
- Lee distance and topological properties of k-ary n-cubes
- Minimale \(n\)-fach kantenzusammenhängende Graphen
Cited in
(7)- scientific article; zbMATH DE number 3150817 (Why is no real title available?)
- Matroidal connectivity and conditional matroidal connectivity of star graphs
- Reliability of m-ary n-dimensional hypercubes under embedded restriction
- Minimum embedded-link-cut split k-ary n-cubes
- Edge isoperimetric method for link fault tolerance of the complete Josephus cube under five models: a unified approach
- Enhancing reliability of folded Petersen networks based on edge partition
- Link fault tolerability of the Cartesian product power graph (K₉ -C₉)^n: conditional edge-connectivities under six link fault patterns
This page was built for publication: Embedded edge connectivity of \(k\)-ary \(n\)-cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2680221)