Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
From MaRDI portal
Publication:1011727
DOI10.1016/j.disc.2008.01.037zbMath1162.05029OpenAlexW2121067592MaRDI QIDQ1011727
Shang-Wei Lin, Shi-ying Wang, Chun-Fang Li
Publication date: 9 April 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.01.037
Related Items (26)
A sufficient condition for graphs to be super \(k\)-restricted edge connected ⋮ Sufficient conditions for \(k\)-restricted edge connected graphs ⋮ Bounds for the Super Extra Edge Connectivity of Graphs ⋮ \(\{2,3\}\)-extraconnectivities of hypercube-like networks ⋮ Optimally restricted edge connected elementary Harary graphs ⋮ Sufficient Conditions for Maximally k-Isoperimetric Edge Connectivity of Graphs ⋮ On anti-Kekulé and \(s\)-restricted matching preclusion problems ⋮ Sufficient conditions for triangle-free graphs to be super \(k\)-restricted edge-connected ⋮ \(k\)-restricted edge-connectivity in triangle-free graphs ⋮ Edge fault tolerance of super edge connectivity for three families of interconnection networks ⋮ A sufficient condition for graphs to be \(\lambda_k\)-optimal ⋮ Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected ⋮ The \(k\)-restricted edge connectivity of balanced bipartite graphs ⋮ Super \(s\)-restricted edge-connectivity of vertex-transitive graphs ⋮ \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs ⋮ Edge fault tolerance analysis of super \(k\)-restricted connected networks ⋮ The \(p\)-restricted edge-connectivity of Kneser graphs ⋮ Vulnerability of super extra edge-connected graphs ⋮ Unnamed Item ⋮ Neighborhood conditions for graphs to be super restricted edge connected ⋮ Super \(p\)-restricted edge connectivity of line graphs ⋮ Unnamed Item ⋮ Reliability analysis of godan graphs ⋮ A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected ⋮ The \(k\)-restricted edge connectivity of undirected Kautz graphs ⋮ Degree conditions for graphs to be maximally \(k\)-restricted edge connected and super \(k\)-restricted edge connected
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
- Sufficient conditions for maximally connected dense graphs
- On computing a conditional edge-connectivity of a graph
- Superconnectivity of bipartite digraphs and graphs
- On a kind of restricted edge connectivity of graphs
- Results on the edge-connectivity of graphs
- Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
- Edge-cuts leaving components of order at least three
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- Optimally super-edge-connected transitive graphs
- On the extraconnectivity of graphs
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Edge cuts leaving components of order at least \(m\)
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
- On restricted connectivities of permutation graphs
- On Isoperimetric Connectivity in Vertex-Transitive Graphs
- Sufficient conditions for λ′‐optimality in graphs with girth g
- On restricted edge-connectivity of graphs.
This page was built for publication: Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
