2024-12-032024-12-032011Balbuena, C., García Vázquez, P., Montejano, L.P. y Salas, J. (2011). On the lambda '-optimality in graphs with odd girth g and even girth h. Applied Mathematics Letters, 24 (7), 1041-1045. https://doi.org/10.1016/j.aml.2011.01.015.0893-96591873-5452https://hdl.handle.net/11441/165240For a connected graph G, 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 edgedegree in G defined as ξ (G) = min{d(u)+d(v)−2 : uv ∈ E(G)}, d(u) denoting the degree of a vertex u. The main result of this paper is that graphs with odd girth g and finite even girth h ≥ g +3 of diameter at most h−4 are λ′-optimal. As a consequence polarity graphs are shown to be λ′-optimal.application/pdf5 p.engConnectivityRestricted connectivityGirth pairPolarity graphsinfo:eu-repo/semantics/articleinfo:eu-repo/semantics/openAccess10.1016/j.aml.2011.01.015