Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
From MaRDI portal
Publication:1850060
DOI10.1016/S0012-365X(02)00299-6zbMath1012.05101OpenAlexW2082105899MaRDI QIDQ1850060
Publication date: 2 December 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00299-6
girthedge-transitivevertex-transitiveconditional edge-connectivitylocally most reliableunreliability polynomial
Random graphs (graph-theoretic aspects) (05C80) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40)
Related Items (64)
A sufficient condition for graphs to be super \(k\)-restricted edge connected ⋮ On locally most reliable three-terminal graphs of sparse graphs ⋮ Sufficient conditions for \(k\)-restricted edge connected graphs ⋮ On edge cut of graphs leaving components of order at least five ⋮ A bound on 4-restricted edge connectivity of graphs ⋮ Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth ⋮ Optimization problems of the third edge-connectivity of 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 the super‐restricted arc‐connectivity of s ‐geodetic digraphs ⋮ On restricted edge-connectivity of vertex-transitive multigraphs ⋮ 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 half vertex transitive graphs ⋮ Optimally restricted edge connected elementary Harary graphs ⋮ Vulnerability of super edge-connected networks ⋮ On super 2-restricted and 3-restricted edge-connected vertex transitive graphs ⋮ Edge fault tolerance of graphs with respect to super edge connectivity ⋮ \( R_3\)-connectivity of folded hypercubes ⋮ On a kind of reliability analysis of networks ⋮ \(\{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 ⋮ The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree ⋮ Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected ⋮ 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 ⋮ Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles ⋮ Sufficient conditions for restricted-edge-connectivity to be optimal ⋮ Extra edge connectivity and isoperimetric edge connectivity ⋮ K-restricted edge connectivity for some interconnection networks ⋮ Conditional connectivity of recursive interconnection networks respect to embedding restriction ⋮ Minimally restricted edge connected graphs ⋮ \(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 ⋮ \(\lambda ^{\prime}\)-optimal digraphs ⋮ On optimally-\(\lambda^{(3)}\) transitive graphs ⋮ On super restricted edge-connectivity of edge-transitive graphs ⋮ Conditional connectivity of star graph networks under embedding restriction ⋮ Sufficient conditions for a graph to be λ k -optimal with given girth and diameter ⋮ Neighborhood conditions for graphs to be super restricted edge connected ⋮ Some remarks on \(\lambda _{p,q}\)-connectedness ⋮ 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 ⋮ On the existence of edge cuts leaving several large components ⋮ 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 ⋮ Edge fault tolerance of graphs with respect to \(\lambda_{2}\)-optimal property ⋮ Super connectivity of line graphs ⋮ Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected ⋮ Edges of degree \(k\) in minimally restricted \(k\)-edge connected graphs ⋮ 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 ⋮ Edge cuts leaving components of order at least \(m\) ⋮ Automorphisms group of generalized Hamming Graphs ⋮ Onm-restricted edge connectivity of undirected generalized De Bruijn graphs
This page was built for publication: Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
