The existence and upper bound for two types of restricted connectivity
From MaRDI portal
Publication:968169
Recommendations
- Restricted connectivity for some interconnection networks
- Cuts leaving components of given minimum order
- Degree conditions for graphs to be maximally \(k\)-restricted edge connected and super \(k\)-restricted edge connected
- Sufficient conditions for restricted-edge-connectivity to be optimal
- On k-restricted connectivity of direct product of graphs
Cites work
- scientific article; zbMATH DE number 3735859 (Why is no real title available?)
- Connectivity of vertex and edge transitive graphs
- Cuts leaving components of given minimum order
- Diameter-girth sufficient conditions for optimal extraconnectivity in graphs
- Extraconnectivity of graphs with large girth
- Graph theory
- Note on the connectivity of line graphs
- On the extraconnectivity of graphs
- On unreliability polynomials and graph connectivity in reliable network synthesis
- Semi-hyper-connected edge transitive graphs
- Semi-hyper-connected vertex transitive graphs
- Subsets with small sums in abelian groups. I: The Vosper property
- Super-connected arc-transitive digraphs
- Super-connected edge transitive graphs
- Synthesis of reliable networks - a survey
- The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
Cited in
(7)- Spectral threshold for extremal cyclic edge-connectivity
- Cuts leaving components of given minimum order
- On k-restricted connectivity of direct product of graphs
- Restricted vertex connectivity of Harary graphs.
- A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices
- The connected cutset connectivity of a graph
- A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs
This page was built for publication: The existence and upper bound for two types of restricted connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968169)
