A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks
From MaRDI portal
Publication:5087062
DOI10.1142/S0129626420400095zbMath1490.68149OpenAlexW3097870658MaRDI QIDQ5087062
Zhizhang Shen, Eddie Cheng, Weihua Yang, Ke Qiu
Publication date: 8 July 2022
Published in: Parallel Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129626420400095
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Structure connectivity and substructure connectivity of hypercubes
- On the Day-Tripathi orientation of the star graphs: connectivity
- Cyclic vertex-connectivity of Cayley graphs generated by transposition trees
- On super 2-restricted and 3-restricted edge-connected vertex transitive graphs
- Edge fault tolerance of graphs with respect to super edge connectivity
- Super restricted edge connectivity of regular edge-transitive graphs
- A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
- Matching preclusion and conditional matching preclusion for regular interconnection networks
- On deriving conditional diagnosability of interconnection networks
- A strong connectivity property of the generalized exchanged hypercube
- Short cycle connectivity
- Recognizing tough graphs is NP-hard
- Orienting Cayley graphs generated by transposition trees
- Vertex fault tolerance of optimal-\(\kappa \) graphs and super-\(\kappa \) graphs
- Strong structural properties of unidirectional star graphs
- Extraconnectivity of hypercubes
- Neighbour-connectivity in regular graphs
- On strong Menger-connectivity of star graphs
- Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness
- The \(h\)-extra connectivity and \(h\)-extra conditional diagnosability of bubble-sort star graphs
- Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks
- Structure fault tolerance of hypercubes and folded hypercubes
- A complete classification of which \((n,k)\)-star graphs are Cayley graphs
- Reliability of \((n,k)\)-star network based on \(g\)-extra conditional fault
- A general approach to deriving the \(g\)-good-neighbor conditional diagnosability of interconnection networks
- A kind of conditional connectivity of Cayley graphs generated by wheel graphs
- Neighbor connectivity of two kinds of Cayley graphs
- Connectivity of vertex and edge transitive graphs
- Connectivity and edge-disjoint spanning trees
- Linearly many faults in dual-cube-like networks
- The super connectivity of exchanged hypercubes
- Neighbor connectivity of \(k\)-ary \(n\)-cubes
- A note on generalized matching preclusion in bipartite graphs
- Strongly Menger connectedness of data center network and \((n,k)\)-star graph
- On the problem of determining which \((n, k)\)-star graphs are Cayley graphs
- On \(g\)-extra connectivity of hypercube-like networks
- The \(g\)-good-neighbor and \(g\)-extra diagnosability of networks
- Generalized measures of fault tolerance in exchanged hypercubes
- Fault tolerance in the arrangement graphs
- Linearly many faults in Cayley graphs generated by transposition trees
- Toughness in graphs -- a survey
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- Tough graphs and Hamiltonian circuits.
- Strong Menger connectivity with conditional faults of folded hypercubes
- Component connectivity of hypercubes
- Relating the extra connectivity and the conditional diagnosability of regular graphs under the comparison model
- Component connectivity of the hypercubes
- LINEARLY MANY FAULTS IN (n, k)-STAR GRAPHS
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
- FAULT RESILIENCY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITIONS
- Maximal vertex-connectivity of
- On the maximal connected component of a hypercube with faulty vertices III
- Conditional connectivity
- Optimal attack and reinforcement of a network
- A group-theoretic model for symmetric interconnection networks
- On the maximal connected component of hypercube with faulty vertices (II)
- Structural Properties of Generalized Exchanged Hypercubes
- On the maximal connected component of hypercube with faulty vertices
- A polynomial time algorithm for cyclic vertex connectivity of cubic graphs
- Linearly many faults in arrangement graphs
- Connectivity of transitive graphs
- The restricted edge-connectivity and restricted connectivity of augmentedk-aryn-cubes
- On restricted edge-connectivity of graphs.
This page was built for publication: A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks
