Relationship between extra edge connectivity and component edge connectivity for regular graphs
From MaRDI portal
Publication:784476
DOI10.1016/J.TCS.2020.05.006zbMATH Open1453.05054OpenAlexW3024902839MaRDI QIDQ784476FDOQ784476
Rong-Xia Hao, Jou-Ming Chang, Mei-Mei Gu
Publication date: 3 August 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.05.006
Recommendations
- Relation of extra edge connectivity and component edge connectivity for regular networks
- The relationship between extra connectivity and conditional diagnosability of regular graphs under the PMC model
- Relating the extra connectivity and the conditional diagnosability of regular graphs under the comparison model
- Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs
- On reliability of hypercubes in terms of extra edge-connectivity
Cites Work
- The \((n,k)\)-star graph: A generalized star graph
- The extra connectivity, extra conditional diagnosability and \(t/k\)-diagnosability of the data center network DCell
- On the extraconnectivity of graphs
- Edge fault tolerance analysis of a class of interconnection networks
- Conditional connectivity
- Extraconnectivity of \(k\)-ary \(n\)-cube networks
- Super edge-connectivity and matching preclusion of data center networks
- Extraconnectivity of hypercubes
- \(\{2,3\}\)-extraconnectivities of hypercube-like networks
- Matching preclusion and conditional matching preclusion for regular interconnection networks
- Bounds for sorting by prefix reversal
- Component connectivity of the hypercubes
- The extra connectivity of bubble-sort star graphs
- Increasing the connectivity of the star graphs
- Title not available (Why is that?)
- Augmented \(k\)-ary \(n\)-cubes
- Largest connected component of a star graph with faulty vertices
- Title not available (Why is that?)
- The $t/k$-Diagnosability of Star Graph Networks
- Girth of pancake graphs
- Fault-tolerant routing in burnt pancake graphs
- Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes
- Conditional connectivity of folded hypercubes
- The 4-component connectivity of alternating group networks
- Strongly Menger connectedness of data center network and \((n,k)\)-star graph
- Fault tolerance and diagnosability of burnt pancake networks under the comparison model
- Component Edge Connectivity of Hypercubes
- The restricted edge-connectivity and restricted connectivity of augmentedk-aryn-cubes
Cited In (11)
- Matroidal connectivity and conditional matroidal connectivity of star graphs
- Enhancing fault tolerance of balanced hypercube networks by the edge partition method
- Component (edge) connectivity of pancake graphs
- Component connectivity of augmented cubes
- The Component Diagnosability of General Networks
- The Component (Edge) Connectivity of Round Matching Composition Networks
- Component conditional fault tolerance of hierarchical folded cubic networks
- The \(g\)-component connectivity of graphs
- \(r\)-component diagnosability of hypercubes under the PMC model
- Enabling high reliability via matroidal connectivity and conditional matroidal connectivity on arrangement graph networks
- Title not available (Why is that?)
This page was built for publication: Relationship between extra edge connectivity and component edge connectivity for regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q784476)