On restricted edge-connectivity of graphs.

From MaRDI portal
Publication:5957722


DOI10.1016/S0012-365X(01)00232-1zbMath1049.05050MaRDI QIDQ5957722

Jun-Ming Xu, Ke-Li Xu

Publication date: 2002

Published in: Discrete Mathematics (Search for Journal in Brave)


05C40: Connectivity


Related Items

On the restricted arc-connectivity of \(s\)-geodetic digraphs, On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks, On super restricted edge-connectivity of edge-transitive graphs, On reliability of the folded hypercubes, Maximally edge-connected and vertex-connected graphs and digraphs: A survey, Extra edge connectivity and isoperimetric edge connectivity, Minimally restricted edge connected graphs, The super connectivity of augmented cubes, \(\lambda ^{\prime}\)-optimal digraphs, The restricted arc connectivity of Cartesian product digraphs, Some remarks on \(\lambda _{p,q}\)-connectedness, 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, Super connectivity of line graphs, Edges of degree \(k\) in minimally restricted \(k\)-edge connected graphs, Cuts leaving components of given minimum order, Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2, 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, \(\lambda ^{\prime}\)-optimally connected mixed Cayley graphs, Sufficient conditions for restricted-edge-connectivity to be optimal, On optimally-\(\lambda^{(3)}\) transitive graphs, Super restricted edge connectivity of regular graphs, A proof of an inequality concerning \(k\)-restricted edge connectivity, Edge cuts leaving components of order at least \(m\), Neighborhood conditions for graphs to be super restricted edge connected, ON EDGE-CONNECTIVITY AND SUPER EDGE-CONNECTIVITY OF INTERCONNECTION NETWORKS MODELED BY PRODUCT GRAPHS