The generalized 4-connectivity of hypercubes
From MaRDI portal
Publication:507578
DOI10.1016/j.dam.2016.12.003zbMath1355.05148OpenAlexW2571445572MaRDI QIDQ507578
Publication date: 6 February 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.12.003
Related Items (18)
The generalized connectivity of alternating group graphs and \((n, k)\)-star graphs ⋮ The Generalized Connectivity of Data Center Networks ⋮ Path 3-(edge-)connectivity of lexicographic product graphs ⋮ The generalized 4-connectivity of locally twisted cubes ⋮ Reliability assessment of the divide-and-swap cube in terms of generalized connectivity ⋮ Restricted arc connectivity of unidirectional hypercubes and unidirectional folded hypercubes ⋮ The generalized 3-connectivity of burnt pancake graphs and godan graphs ⋮ The 4-set tree connectivity of \((n, k)\)-star networks ⋮ The generalized 4-connectivity of hierarchical cubic networks ⋮ The reliability analysis based on the generalized connectivity in balanced hypercubes ⋮ Two kinds of generalized connectivity of dual cubes ⋮ \(k\)-tree connectivity of line graphs ⋮ The generalized 3-connectivity of two kinds of regular networks ⋮ The generalized 4-connectivity of exchanged hypercubes ⋮ The Generalized Connectivity of Bubble-Sort Star Graphs ⋮ Generalized 4-connectivity of hierarchical star networks ⋮ The generalized 4-connectivity of pancake graphs ⋮ Internally disjoint trees in the line graph and total graph of the complete bipartite graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\{2,3\}\)-extraconnectivities of hypercube-like networks
- An efficient parallel construction of optimal independent spanning trees on hypercubes
- Extraconnectivity of \(k\)-ary \(n\)-cube networks
- The connectivity and the Harary index of a graph
- Fault-tolerant cycles embedding in hypercubes with faulty edges
- On reliability of the folded hypercubes in terms of the extra edge-connectivity
- \(\{2,3\}\)-restricted connectivity of locally twisted cubes
- Constructing edge-disjoint spanning trees in locally twisted cubes
- Independent trees in planar graphs
- Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
- Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
- Constructing edge-disjoint spanning trees in twisted cubes
- A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
- Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
- Edge-disjoint spanning trees on the star network with applications to fault tolerance
- Increasing the connectivity of the star graphs
- Combinatorial analysis of the fault-diameter of the n-cube
- The generalized 3-connectivity of Cartesian product graphs
This page was built for publication: The generalized 4-connectivity of hypercubes
