Bounding the size of the subgraph induced by \(m\) vertices and extra edge-connectivity of hypercubes
From MaRDI portal
Publication:2444570
DOI10.1016/j.dam.2013.04.009zbMath1285.05129OpenAlexW2051120783MaRDI QIDQ2444570
Publication date: 10 April 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.04.009
Hypergraphs (05C65) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (22)
Component connectivity of hypercubes ⋮ The extra connectivity of bubble-sort star graphs ⋮ Relating the extra connectivity and the conditional diagnosability of regular graphs under the comparison model ⋮ GHWs of codes arising from Cartesian product of graphs ⋮ Reliability measure of the \(n\)-th Cartesian product of complete graph \(K_4\) on \(h\)-extra edge-connectivity ⋮ Link fault tolerance of BC networks and folded hypercubes on \(h\)-extra \(r\)-component edge-connectivity ⋮ On extra connectivity and extra edge-connectivity of balanced hypercubes ⋮ Concentration behavior: 50 percent of \(h\)-extra edge connectivity of pentanary \(n\)-cube with exponential faulty edges ⋮ An O(log(N)) Algorithm View: Reliability Evaluation of Folded-crossed Hypercube in Terms of h-extra Edge-connectivity ⋮ Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes ⋮ Many-to-many edge-disjoint paths in \((n,k)\)-enhanced hypercube under three link-faulty hypotheses ⋮ Reliability measure of multiprocessor system based on enhanced hypercubes ⋮ Edge disjoint paths in hypercubes and folded hypercubes with conditional faults ⋮ Reliability analysis of bijective connection networks in terms of the extra edge-connectivity ⋮ On the extraconnectivity of k-ary n-cube networks ⋮ On reliability of the folded hypercubes in terms of the extra edge-connectivity ⋮ On the extra edge-connectivity of hypercubes ⋮ Component Edge Connectivity of Hypercubes ⋮ The line completion number of hypercubes ⋮ Number of proper paths in edge-colored hypercubes ⋮ The extra connectivity of the enhanced hypercubes ⋮ Component edge connectivity of hypercube-like networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decomposing the hypercube \(Q_n\) into \(n\) isomorphic edge-disjoint trees
- Generalized measures of fault tolerance in hypercube networks
- On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks
- Counting hypercubes in hypercubes
- On reliability of the folded hypercubes
- Extraconnectivity of hypercubes
- Bounding the size of square-free subgraphs of the hypercube
- Perfect matchings extend to Hamilton cycles in hypercubes
- A note on short cycles in a hypercube
This page was built for publication: Bounding the size of the subgraph induced by \(m\) vertices and extra edge-connectivity of hypercubes
