Concentration behavior: 50 percent of \(h\)-extra edge connectivity of pentanary \(n\)-cube with exponential faulty edges
From MaRDI portal
Publication:6123379
DOI10.1007/s10878-023-01098-3WikidataQ129504534 ScholiaQ129504534MaRDI QIDQ6123379
Tengteng Liang, Mingzu Zhang, Sufang Liu
Publication date: 4 March 2024
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of computing the \(k\)-restricted edge-connectivity of a graph
- Reliability analysis of bijective connection networks in terms of the extra edge-connectivity
- Many-to-many disjoint paths in hypercubes with faulty vertices
- On the extra edge-connectivity of hypercubes
- Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes
- Extraconnectivity of graphs with large girth
- On the extraconnectivity of graphs
- Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs
- The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks
- Bounding the size of the subgraph induced by \(m\) vertices and extra edge-connectivity of hypercubes
- Reliability measure of the \(n\)-th Cartesian product of complete graph \(K_4\) on \(h\)-extra edge-connectivity
- Constructing one-to-many disjoint paths in folded hypercubes
- Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest
