Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\)
type: Item
instance of: scholarly article
title: Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\)
zbMATH Open document ID: 1182.05075
author: Li Shang
author: Heping Zhang
published in: Discrete Mathematics
publication date: 2009-06-23T00:00:00Z
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 5569080
zbMATH Keywords: 3-restricted edge connectivity
zbMATH Keywords: optimally 3-restricted edge connected
zbMATH Keywords: super-3-restricted edge connected
MaRDI profile type: Publication
full work available at URL: j.disc.2008.09.051
OpenAlex ID: W2055695880
cites work: Extraconnectivity of graphs with large minimum degree and girth
cites work: Edge-cuts leaving components of order at least three
cites work: On computing a conditional edge-connectivity of a graph
cites work: Extraconnectivity of graphs with large girth
cites work: On the extraconnectivity of graphs
cites work: Cuts leaving components of given minimum order
cites work: Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
cites work: Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
cites work: Maximally edge-connected and vertex-connected graphs and digraphs: A survey
cites work: Results on the edge-connectivity of graphs
cites work: On a kind of restricted edge connectivity of graphs
cites work: Edge cuts leaving components of order at least \(m\)
cites work: A bound on 4-restricted edge connectivity of graphs
cites work: Q5464303
cites work: Sufficient conditions for graphs to be λ′‐optimal and super‐λ′
cites work: Q5781249
cites work: Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
cites work: Optimization problems of the third edge-connectivity of graphs
cites work: Super-edge-connectivity properties of graphs with diameter 2
cites work: Upper bound on the third edge-connectivity of graphs
cites work: On optimally-\(\lambda^{(3)}\) transitive graphs
cites work: A proof of an inequality concerning \(k\)-restricted edge connectivity
cites work: Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
cites work: Sufficient conditions for restricted-edge-connectivity to be optimal
DOI: 10.1016/J.DISC.2008.09.051
description: scientific article; zbMATH DE number 5569080