Journal of Graph Theory · 2006 · 49 citations · 13 references
Natural SciencesMathematicsCombinatoricsComputational GeometryOptimizationCombinatorial OptimizationGraph AlgorithmsGraph TheoryNetwork DiameterGraph ConnectivityGraph DiameterGraph Theory AnalysisGraph Theory Models
Abstract For a connected graph the restricted edge‐connectivity λ′( G ) is defined as the minimum cardinality of an edge‐cut over all edge‐cuts S such that there are no isolated vertices in G – S . A graph G is said to be λ′‐optimal if λ′( G ) = ξ( G ), where ξ( G ) is the minimum edge‐degree in G defined as ξ( G ) = min { d ( u ) + d ( v ) − 2: uv ∈ E ( G )}, d ( u ) denoting the degree of a vertex u . A. Hellwig and L. Volkmann [Sufficient conditions for λ′‐optimality in graphs of diameter 2, Discrete Math 283 (2004), 113–120] gave a sufficient condition for λ′‐optimality in graphs of diameter 2. In this paper, we generalize this condition in graphs of diameter g − 1, g being the girth of the graph, and show that a graph G with diameter at most g − 2 is λ′‐optimal. © 2006 Wiley Periodicals, Inc. J Graph Theory 52: 73–86, 2006
13
Circulants and their connectivities
F Boesch, Ralph Tindell · Journal of Graph Theory · 1984 · 351 citations
Synthesis of reliable networks - a survey
F Boesch · IEEE Transactions on Reliability · 1986 · 179 citations
J. Fàbrega, M.A. Fiol · Journal of Graph Theory · 1989 · 142 citations
On restricted edge-connectivity of graphs
Jun‐Ming Xu, Ke-li Xu · Discrete Mathematics · 2002 · 90 citations