The 4-set tree connectivity of folded hypercube
From MaRDI portal
Cites work
- Conditional connectivity of folded hypercubes
- Fault Diagnosis in a Boolean n Cube Array of Microprocessors
- Generalized Connectivity of Graphs
- Graph theory
- Note on the generalized connectivity.
- On g-extra connectivity of folded hypercubes
- On reliability of the folded hypercubes
- 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 Cayley graphs on symmetric groups generated by trees and cycles
- The generalized 3-connectivity of graph products
- The generalized 3-connectivity of star graphs and bubble-sort graphs
- The generalized 3-connectivity of the Mycielskian of a graph
- 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.
- The generalized connectivity of complete equipartition 3-partite graphs
- Two kinds of generalized connectivity of dual cubes
This page was built for publication: The 4-set tree connectivity of folded hypercube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970131)