The 4-set tree connectivity of hierarchical folded hypercube
From MaRDI portal
Cites work
- A recursive algorithm for constructing dual-CISTs in hierarchical folded cubic networks
- Component conditional fault tolerance of hierarchical folded cubic networks
- Congruent graphs and the connectivity of graphs
- Edge-independent spanning trees in augmented cubes
- Fault tolerance analysis of hierarchical folded cube
- Generalized 4-connectivity of hierarchical star networks
- Generalized Connectivity of Graphs
- Note on the generalized connectivity.
- On independent spanning trees
- On the difference of two generalized connectivities of a graph
- On two generalized connectivities of graphs
- Rainbow trees in graphs and generalized connectivity
- Sharp bounds for the generalized connectivity \(\kappa _{3}(G)\)
- Steiner tree packing number and tree connectivity
- The 4-set tree connectivity of (n, k)-star networks
- The generalized 3-connectivity of Cartesian product
- The generalized 3-connectivity of graph products
- The generalized 3-connectivity of star graphs and bubble-sort graphs
- The generalized 4-connectivity of exchanged hypercubes
- The generalized 4-connectivity of hierarchical cubic networks
- The generalized 4-connectivity of hypercubes
- The generalized connectivity of alternating group graphs and \((n, k)\)-star graphs
- The generalized connectivity of complete bipartite graphs.
- Two kinds of generalized connectivity of dual cubes
This page was built for publication: The 4-set tree connectivity of hierarchical folded hypercube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6584761)