Some remarks on _p,q-connectedness
From MaRDI portal
Publication:998437
Recommendations
Cites work
- scientific article; zbMATH DE number 3513839 (Why is no real title available?)
- scientific article; zbMATH DE number 3603293 (Why is no real title available?)
- scientific article; zbMATH DE number 1055145 (Why is no real title available?)
- A homology theory for spanning tress of a graph
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Bound on \(m\)-restricted edge connectivity
- Conditional connectivity
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- Cuts leaving components of given minimum order
- Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
- Edge cuts leaving components of order at least \(m\)
- Edge-cuts leaving components of order at least three
- Graph theory
- On a kind of restricted edge connectivity of graphs
- On computing a conditional edge-connectivity of a graph
- On restricted connectivities of permutation graphs
- On restricted edge-connectivity of graphs.
- On the edge-connectivity and restricted edge-connectivity of a product of graphs
- Restricted connectivity for three families of interconnection networks
- Super restricted edge-connectivity of vertex-transitive graphs
- Super-connectivity and super-edge-connectivity for some interconnection networks
Cited in
(6)- Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs
- Under which conditions is λ″(G)=κ″(L(G)) ?
- Edge-cuts leaving components of order at least three
- Characterization of \(\lambda_{3,q}\)-connected graphs
- On criteria of disconnectedness of \(\Lambda\)-Fleming-Viot support
- Edge fault tolerance of graphs with respect to super edge connectivity
This page was built for publication: Some remarks on \(\lambda _{p,q}\)-connectedness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998437)
