On restricted edge-connectivity of graphs.
From MaRDI portal
Publication:5957722
DOI10.1016/S0012-365X(01)00232-1zbMath1049.05050OpenAlexW2145049986MaRDI QIDQ5957722
Publication date: 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00232-1
Related Items (57)
Packing spanning trees in highly essentially connected graphs ⋮ Restricted connectivity for three families of interconnection networks ⋮ Fault-tolerant analysis of a class of networks ⋮ Restricted arc-connectivity of digraphs ⋮ A bound on 4-restricted edge connectivity of graphs ⋮ Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth ⋮ On the super‐restricted arc‐connectivity of s ‐geodetic digraphs ⋮ On restricted edge-connectivity of lexicographic product graphs ⋮ On the restricted arc-connectivity of \(s\)-geodetic digraphs ⋮ A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks ⋮ On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks ⋮ Edge fault-tolerance of strongly Menger edge connected graphs ⋮ On reliability of the folded hypercubes ⋮ On super restricted edge connectivity of half vertex transitive graphs ⋮ Optimally restricted edge connected elementary Harary graphs ⋮ Vulnerability of super edge-connected networks ⋮ Edge fault tolerance of graphs with respect to super edge connectivity ⋮ An extended study of k-restricted edge connectivity: Another approach to Tait’s coloring theorem ⋮ Super-connected but not super edge-connected graphs ⋮ Super restricted edge connectivity of regular edge-transitive graphs ⋮ \(\lambda ^{\prime}\)-optimally connected mixed Cayley graphs ⋮ Super restricted edge connectivity of regular graphs with two orbits ⋮ Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes ⋮ On restricted edge-connectivity of replacement product graphs ⋮ Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs ⋮ Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected ⋮ \(\lambda^{\prime}\)-optimality of bipartite digraphs ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Sufficient conditions for restricted-edge-connectivity to be optimal ⋮ Extra edge connectivity and isoperimetric edge connectivity ⋮ Minimally restricted edge connected graphs ⋮ ON EDGE-CONNECTIVITY AND SUPER EDGE-CONNECTIVITY OF INTERCONNECTION NETWORKS MODELED BY PRODUCT GRAPHS ⋮ The super connectivity of augmented cubes ⋮ \(\lambda ^{\prime}\)-optimal digraphs ⋮ On optimally-\(\lambda^{(3)}\) transitive graphs ⋮ On super restricted edge-connectivity of edge-transitive graphs ⋮ Super restricted edge connectivity of regular graphs ⋮ Cuts leaving components of given minimum order ⋮ Unnamed Item ⋮ Neighborhood conditions for graphs to be super restricted edge connected ⋮ The restricted arc connectivity of Cartesian product digraphs ⋮ Some remarks on \(\lambda _{p,q}\)-connectedness ⋮ Atoms of cyclic edge connectivity in regular graphs ⋮ On super edge-connectivity of product graphs ⋮ Diameter-sufficient conditions for a graph to be super-restricted connected ⋮ Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2 ⋮ On the 3-restricted edge connectivity of permutation graphs ⋮ Super-connected arc-transitive digraphs ⋮ Minimally 3-restricted edge connected graphs ⋮ 3-restricted connectivity of graphs with given girth ⋮ Edge fault tolerance of graphs with respect to \(\lambda_{2}\)-optimal property ⋮ Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2 ⋮ Super connectivity of line graphs ⋮ Edges of degree \(k\) in minimally restricted \(k\)-edge connected graphs ⋮ A proof of an inequality concerning \(k\)-restricted edge connectivity ⋮ Edge cuts leaving components of order at least \(m\) ⋮ On the conditional edge connectivity of double-orbit graphs
This page was built for publication: On restricted edge-connectivity of graphs.
