On a kind of restricted edge connectivity of graphs
From MaRDI portal
Publication:1348390
DOI10.1016/S0166-218X(00)00337-1zbMath1007.05067WikidataQ126778290 ScholiaQ126778290MaRDI QIDQ1348390
Publication date: 15 May 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
A sufficient condition for graphs to be super \(k\)-restricted edge connected, Restricted connectivity for three families of interconnection networks, Sufficient conditions for \(k\)-restricted edge connected graphs, Fault-tolerant analysis of a class of networks, A bound on 4-restricted edge connectivity of graphs, Note on the connectivity of line graphs, Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal, Bounds for the Super Extra Edge Connectivity of Graphs, \(\{2,3\}\)-extraconnectivities of hypercube-like networks, A new approach to finding the extra connectivity of graphs, On restricted edge-connectivity of vertex-transitive multigraphs, 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 O(log(N)) Algorithm View: Reliability Evaluation of Folded-crossed Hypercube in Terms of h-extra Edge-connectivity, Enhancing fault tolerance of balanced hypercube networks by the edge partition method, On optimizing edge connectivity of product graphs, \( R_3\)-connectivity of folded hypercubes, Super restricted edge connectivity of regular edge-transitive graphs, \(k\)-restricted edge-connectivity in triangle-free graphs, \(\{2,3\}\)-restricted connectivity of locally twisted cubes, On restricted edge-connectivity of replacement product graphs, Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs, Bound on \(m\)-restricted edge connectivity, The \(k\)-restricted edge connectivity of balanced bipartite graphs, Super \(\lambda_3\)-optimality of regular graphs, Maximally edge-connected and vertex-connected graphs and digraphs: A survey, Edge-connectivity of regular graphs with two orbits, Sufficient conditions for restricted-edge-connectivity to be optimal, Extra edge connectivity and isoperimetric edge connectivity, The \(h\)-restricted connectivity of balanced hypercubes, K-restricted edge connectivity for some interconnection networks, Conditional connectivity of recursive interconnection networks respect to embedding restriction, The \(k\)-restricted edge-connectivity of the data center network DCell, \(h\)-restricted connectivity of locally twisted cubes, Edge fault tolerance analysis of super \(k\)-restricted connected networks, Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs, Vulnerability of super extra edge-connected graphs, Semi-hyper-connected edge transitive graphs, On optimally-\(\lambda^{(3)}\) transitive graphs, A general sufficient condition for a graph \(G\) with \(\lambda _{m }(G) \leqslant \zeta _{m }(G)\), On super restricted edge-connectivity of edge-transitive graphs, Super restricted edge connectivity of regular graphs, Cuts leaving components of given minimum order, Conditional connectivity of star graph networks under embedding restriction, A survey of some network reliability analysis and synthesis results, Sufficient conditions for a graph to be λ k -optimal with given girth and diameter, 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, On 3-restricted edge connectivity of undirected binary Kautz graphs, Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2, Unnamed Item, Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\), Minimally 3-restricted edge connected graphs, 3-restricted connectivity of graphs with given girth, Super connectivity of line graphs, Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected, The \(k\)-restricted edge connectivity of undirected Kautz graphs, A proof of an inequality concerning \(k\)-restricted edge connectivity, Degree conditions for graphs to be maximally \(k\)-restricted edge connected and super \(k\)-restricted edge connected, On the conditional edge connectivity of double-orbit graphs, Onm-restricted edge connectivity of undirected generalized De Bruijn graphs
Cites Work