On restricted edge-connectivity of graphs.
From MaRDI portal
Publication:5957722
DOI10.1016/S0012-365X(01)00232-1zbMATH Open1049.05050OpenAlexW2145049986MaRDI QIDQ5957722FDOQ5957722
Authors: Jun-Ming Xu, Ke-Li Xu 
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
Recommendations
- On a kind of restricted edge connectivity of graphs
- scientific article; zbMATH DE number 5064073
- scientific article; zbMATH DE number 2121669
- Restricted edge connectivity of regular graphs
- The restricted edge-connectivity of Kautz undirected graphs.
- On equality of restricted edge connectivity and minimum edge degree of graphs.
- Local restricted edge connectivity and restricted edge connectivity of graphs.
- scientific article
- scientific article; zbMATH DE number 2151843
- On optimizing restricted edge connectivity of graphs
Cited In (64)
- On optimizing restricted edge connectivity of graphs
- On edge-connectivity and super edge-connectivity of interconnection networks modeled by product graphs
- Title not available (Why is that?)
- An extended study of k-restricted edge connectivity: Another approach to Tait’s coloring theorem
- On the conditional edge connectivity of double-orbit graphs
- \(\lambda ^{\prime}\)-optimally connected mixed Cayley graphs
- Vulnerability of super edge-connected networks
- Edge fault-tolerance of strongly Menger edge connected graphs
- A bound on 4-restricted edge connectivity of graphs
- Super restricted edge connectivity of regular edge-transitive graphs
- Title not available (Why is that?)
- Atoms of cyclic edge connectivity in regular graphs
- Edge fault tolerance of graphs with respect to super edge connectivity
- On super restricted edge-connectivity of edge-transitive graphs
- Diameter-sufficient conditions for a graph to be super-restricted connected
- Title not available (Why is that?)
- Packing spanning trees in highly essentially connected graphs
- Fault-tolerant analysis of a class of networks
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Super restricted edge connectivity of regular graphs with two orbits
- Sufficient conditions for restricted-edge-connectivity to be optimal
- Some remarks on \(\lambda _{p,q}\)-connectedness
- Super-connected arc-transitive digraphs
- Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs
- Optimally restricted edge connected elementary Harary graphs
- Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected
- \(\lambda ^{\prime}\)-optimal digraphs
- The super connectivity of augmented cubes
- The restricted arc connectivity of Cartesian product digraphs
- Super connectivity of line graphs
- On super restricted edge connectivity of half vertex transitive graphs
- Cuts leaving components of given minimum order
- On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks
- On restricted edge-connectivity of lexicographic product graphs
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- \(\lambda^{\prime}\)-optimality of bipartite digraphs
- Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth
- On the restricted arc-connectivity of \(s\)-geodetic digraphs
- Title not available (Why is that?)
- Super restricted edge connectivity of regular graphs
- On the super-restricted arc-connectivity of \(s\)-geodetic digraphs
- Minimally 3-restricted edge connected graphs
- Restricted connectivity for three families of interconnection networks
- 3-restricted connectivity of graphs with given girth
- On optimally-\(\lambda^{(3)}\) transitive graphs
- Restricted arc-connectivity of digraphs
- Title not available (Why is that?)
- Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes
- On reliability of the folded hypercubes
- Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
- Super-connected but not super edge-connected graphs
- Minimally restricted edge connected graphs
- Title not available (Why is that?)
- 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\)
- A sufficient condition for the equality between the restricted edge-connectivity and the minimum edge-degree of graphs
- Extra edge connectivity and isoperimetric edge connectivity
- On super edge-connectivity of product graphs
- On the 3-restricted edge connectivity of permutation graphs
- On restricted edge-connectivity of replacement product graphs
- Neighborhood conditions for graphs to be super restricted edge connected
- A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks
- Edge fault tolerance of graphs with respect to \(\lambda_{2}\)-optimal property
This page was built for publication: On restricted edge-connectivity of graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957722)
