A new approach to finding the extra connectivity of graphs
From MaRDI portal
Publication:2656973
Recommendations
Cites work
- scientific article; zbMATH DE number 3735859 (Why is no real title available?)
- scientific article; zbMATH DE number 1332751 (Why is no real title available?)
- Bounds on isoperimetric values of trees
- Conditional connectivity
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- Conditional fault diagnosis of hierarchical hypercubes
- Connectivity measures in matched sum graphs
- Diameter-sufficient conditions for a graph to be super-restricted connected
- Edge fault tolerance analysis of a class of interconnection networks
- Extraconnectivity of \(k\)-ary \(n\)-cube networks
- Extraconnectivity of graphs with large girth
- Extraconnectivity of hypercubes
- Generalized measures of fault tolerance in hypercube networks
- Graph theory with applications
- Increasing the connectivity of split-stars
- Increasing the connectivity of the star graphs
- K-restricted edge connectivity for some interconnection networks
- Linearly many faults in Cayley graphs generated by transposition trees
- Lower bounds for the isoperimetric numbers of random regular graphs
- On a kind of restricted edge connectivity of graphs
- On computing a conditional edge-connectivity of a graph
- On conditional diagnosability of the folded hypercubes
- On reliability of the folded hypercubes
- On super and restricted connectivity of some interconnection networks.
- On super edge-connectivity of Cartesian product graphs
- On the 3-restricted edge connectivity of permutation graphs
- On the edge-connectivity and restricted edge-connectivity of a product of graphs
- Optimal numberings and isoperimetric problems on graphs
- Reliability Evaluation of BC Networks
- Restricted arc-connectivity of digraphs
- Restricted connectivity for three families of interconnection networks
- Super connectivity of Kronecker products of graphs
- Super connectivity of line graphs
- Super edge connectivity properties of connected edge symmetric graphs
- Super edge-connectivity of dense digraphs and graphs
- Super restricted edge connected Cartesian product graphs
- Super restricted edge-connectivity of vertex-transitive graphs
- Synthesis of reliable networks - a survey
- The restricted arc connectivity of Cartesian product digraphs
- The super connectivity of augmented cubes
- The super connectivity of exchanged hypercubes
- The super connectivity of the pancake graphs and the super laceability of the star graphs
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
Cited in
(8)- Generalized fault-tolerance for enhanced hypercubes
- A new proof for exact relationship between extra connectivity and extra diagnosability of regular connected graphs under MM* model
- scientific article; zbMATH DE number 1895064 (Why is no real title available?)
- An extension of the Newman-Janis algorithm
- \(r\)-component diagnosability of hypercubes under the PMC model
- Note on reliability of star graphs
- High fault-tolerant performance of the divide-and-swap cube network
- Structure connectivity and substructure connectivity of split-star networks
This page was built for publication: A new approach to finding the extra connectivity of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2656973)
