On conditional edge-connectivity of graphs
type: Item
instance of: scholarly article
title: On conditional edge-connectivity of graphs
zbMATH Open document ID: 0961.05042
DOI: 10.1007/BF02671131
published in: Acta Mathematicae Applicatae Sinica. English Series
publication date: 2001-05-21T00:00:00Z
review text: Let \(G\) be a graph. Then the conditional \(h\)-edge connectivity of \(G\), \(\lambda ^{(h)}(G),\) is the minimum cardinality \(\left|S\right|\) of a set \(S\) of edges of \(G\) so that \(G-S\) is disconnected and the minimum degree of \(G-S\) is at least \(h.\) It is shown in the paper that \(\lambda ^{(2)}(G)\) exists for \(k\)-regular graphs, \(k\geq 3\) and \(\lambda ^{(h)}(G)\leq g(k-2),\) where \(g\) is the girth of \(G.\)
reviewed by: Peter Horák
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 1558291
zbMATH Keywords: conditional edge connectivity
author: Jun-Ming Xu
MaRDI profile type: Publication
cites work: Q3097395
cites work: Conditional connectivity
cites work: On computing a conditional edge-connectivity of a graph
cites work: Q4260012
cites work: Refined connectivity properties of abelian Cayley graphs
cites work: Q4859015
cites work: Q4873740
description: scientific article; zbMATH DE number 1558291