k-restricted edge connectivity in (p+1)-clique-free graphs
DOI10.1016/J.DAM.2014.10.008zbMATH Open1304.05088OpenAlexW2056376345MaRDI QIDQ479049FDOQ479049
Authors: Lei Zhang, Shiying Wang, Shangwei Lin 
Publication date: 5 December 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.10.008
Recommendations
- Sufficient conditions for \(k\)-restricted edge connected graphs
- Sufficient conditions for restricted-edge-connectivity to be optimal
- A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected
- Degree conditions for graphs to be maximally \(k\)-restricted edge connected and super \(k\)-restricted edge connected
- \(k\)-restricted edge-connectivity in triangle-free graphs
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Cites Work
- Graph theory
- Extraconnectivity of graphs with large girth
- The \(k\)-restricted edge-connectivity of a product of graphs
- Title not available (Why is that?)
- On computing a conditional edge-connectivity of a graph
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
- Edge-cuts leaving components of order at least three
- Super restricted edge-connectivity of graphs with diameter 2
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Neighborhood conditions for graphs to be super restricted edge connected
- Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected
- Sufficient conditions for maximally restricted edge connected graphs
- Sufficient conditions for λ′‐optimality in graphs with girth g
- Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
- \(k\)-restricted edge-connectivity in triangle-free graphs
- On a kind of reliability analysis of networks
- Super restricted edge connectivity of regular graphs with two orbits
- A bound on 4-restricted edge connectivity of graphs
- A general sufficient condition for a graph \(G\) with \(\lambda _{m }(G) \leqslant \zeta _{m }(G)\)
Cited In (10)
- On the complexity of computing the \(k\)-restricted edge-connectivity of a graph
- \(k\)-restricted edge-connectivity in triangle-free graphs
- The \(k\)-restricted edge connectivity of undirected Kautz graphs
- Arc fault tolerance of Kautz digraphs
- Title not available (Why is that?)
- Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth
- An anti-Ramsey theorem of \(k\)-restricted edge-cuts
- Sufficient conditions for triangle-free graphs to be super \(k\)-restricted edge-connected
- The \(p\)-restricted edge-connectivity of Kneser graphs
- On the complexity of computing the \(k\)-restricted edge-connectivity of a graph
This page was built for publication: \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q479049)
