Conditional connectivity
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3637904 (Why is no real title available?)
- scientific article; zbMATH DE number 3226832 (Why is no real title available?)
- scientific article; zbMATH DE number 3040383 (Why is no real title available?)
- Cutpoints in the conjunction of two graphs
- Maximal Flow Through a Network
Cited in
(only showing first 100 items - show all)- Structure and substructure connectivity of balanced hypercubes
- Structure and Substructure Connectivity of Hypercube-Like Networks
- The structure of 2-matching connected graphs
- Reliability of m-ary n-dimensional hypercubes under embedded restriction
- On the conditional edge connectivity of double-orbit graphs
- Reliability evaluation of conditional recursive networks under h-conditional restriction
- On conditional fault tolerance of hierarchical cubic networks
- The restricted h-connectivity of the data center network DCell
- Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes
- Fault-tolerance of (n, k)-star networks
- Reliability and hybrid diagnosis of exchanged hypercube
- Reliability measure of multiprocessor system based on enhanced hypercubes
- One-to-one communication in twisted cubes under restricted connectivity
- The super edge connectivity of Kronecker product graphs
- Conditional matroidal edge connectivity of Cayley graphs
- Generalized measures of fault tolerance in hypercube networks
- The extra connectivity of the enhanced hypercubes
- On \(g\)-extra connectivity of hypercube-like networks
- On super restricted edge-connectivity of edge-transitive graphs
- \(k\)-path-connectivity of the complete balanced tripartite graph \(K_{n, n, n}\) for \(n + 1 \leq k \leq 2 n - 4\)
- On conditional connectivity of the Cartesian product of cycles
- Graphical properties of clustered graphs
- On the super (edge)-connectivity of generalized Johnson graphs
- Efficient unicast in bijective connection networks with the restricted faulty node set
- An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
- On the extraconnectivity of \(k\)-ary \(n\)-cube networks
- The generalized measure of edge fault tolerance in exchanged crossed cube
- On extra connectivity and extra edge-connectivity of balanced hypercubes
- The reliability analysis based on the generalized connectivity in balanced hypercubes
- Cyclic Vertex (Edge) Connectivity of Burnt Pancake Graphs
- Component edge connectivity of hypercube-like networks
- Structure fault tolerance of WK-recursive networks
- Diameter-sufficient conditions for a graph to be super-restricted connected
- Connectivity measures in matched sum graphs
- Further study on k-restricted edge connectivity and exact k-restricted edge connectivity of a graph
- Diameter, short paths and superconnectivity in digraphs
- On \(g\)-extra conditional diagnosability of hypercubes and folded hypercubes
- Super connectivity of Kronecker product of complete bipartite graphs and complete graphs
- Structure connectivity and substructure connectivity of hypercubes
- Restricted connectivity of Cayley graph generated by transposition trees
- \(\{2,3\}\)-extraconnectivities of hypercube-like networks
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- The \(k\)-diameter component edge connectivity parameter
- Link fault tolerability of the Cartesian product power graph (K₉ -C₉)^n: conditional edge-connectivities under six link fault patterns
- Edge isoperimetric method: at least \(2 / 3\) of \(h\)-extra edge-connectivity of a kind of cube-based graphs concentrates on \(2^{n - 1}\)
- Fault-tolerability analysis of hypercubes based on 3-component path-structure connectivity
- On the connectivity of \((k,g)\)-cages of even girth
- Fault-tolerant analysis of a class of networks
- A kind of conditional vertex connectivity of star graphs
- Super \(R^k\)-vertex-connectedness
- Vulnerability of super extra edge-connected graphs
- \(k\)-restricted edge-connectivity in triangle-free graphs
- Super restricted edge connectivity of regular graphs with two orbits
- Disjoint path covers of star graphs
- Component connectivity of wheel networks
- k-path-edge-connectivity of the complete balanced bipartite graph
- Fault tolerance assessment for Hamming graphs based on r-restricted R-structure(substructure) fault pattern
- Super fault-tolerance assessment of locally twisted cubes based on the structure connectivity
- Structure fault tolerance of \(k\)-ary \(n\)-cube networks
- Fault tolerability evaluation for the component edge-connectivity of folded Petersen networks
- Fault tolerance of composite graph based on disc-ring and folded hypercube
- Connectivity and super connectivity of enhanced folded hypercube-like networks
- Some remarks on \(\lambda _{p,q}\)-connectedness
- On cyclic edge-connectivity of transitive graphs
- Sufficient conditions for restricted-edge-connectivity to be optimal
- Super-connected arc-transitive digraphs
- Structure connectivity of data center networks
- On the reliability of generalized Petersen graphs
- The super-connectivity of Kneser graphs
- Cluster connectivity and super cluster connectivity of half hypercube networks
- On anti-Kekulé and s-restricted matching preclusion problems
- Fault tolerability analysis of folded crossed cubes based on \(g\)-component and \(g\)-good neighbor fault pattern
- The g-extra conditional diagnosability of graphs in terms of g-extra connectivity
- Extraconnectivity of graphs with large girth
- Tree robustness of a graph
- The \(h\)-restricted connectivity of the generalized hypercubes
- The \(h\)-restricted connectivity of balanced hypercubes
- Minimally 4-edge\(^ \#\)-connected graphs
- The matching-connectivity of a graph
- Conditional edge connectivity of the locally twisted cubes
- Proportional component order network connectivity
- Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected
- Star fault tolerance of hypercube
- The extra connectivity and extra diagnosability of regular interconnection networks
- Super-connected edge transitive graphs
- On restricted edge-connectivity of vertex-transitive multigraphs
- Edge fault tolerance analysis of super \(k\)-restricted connected networks
- A kind of conditional fault tolerance of alternating group graphs
- Conditional connectivity of Cayley graphs generated by transposition trees
- Essential connectivity and spectral radius of graphs
- Extraconnectivity of hypercubes
- Connectivity and super connectivity of folded hypercube-like networks
- A brief account on the development and future research directions of connectivity properties of interconnection networks
- Dynamic graph models
- On the extra edge-connectivity of hypercubes
- \(\lambda _c\)-Optimally half vertex transitive graphs with regularity \(k\)
- The extra connectivity, extra conditional diagnosability and \(t/k\)-diagnosability of the data center network DCell
- On super restricted edge connectivity of half vertex transitive graphs
- The super-connectivity of the Kneser graph \(KG(n,3)\)
- The Component (Edge) Connectivity of Round Matching Composition Networks
This page was built for publication: Conditional connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3659811)