A note on the edge-connectivity of cages
type: Item
instance of: scholarly article
title: A note on the edge-connectivity of cages
zbMATH Open document ID: 1016.05047
author: Ping Wang
author: Bao-guang Xu
author: Jianfang Wang
published in: The Electronic Journal of Combinatorics
publication date: 2003-05-07T00:00:00Z
full work available at URL: https://eudml.org/doc/122755
full work available at URL: v10i1n2.html
review text: Summary: A \((k;g)\)-graph is a \(k\)-regular graph with girth \(g\). A \((k;g)\)-cage is a \((k;g)\)-graph with the smallest possible number of vertices. We prove that \((k;g)\)-cages are \(k\)-edge-connected if \(k\geq 3\) and \(g\) is odd.
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 1907105
zbMATH Keywords: girth
zbMATH Keywords: \((k
zbMATH Keywords: g)\)-cage
MaRDI profile type: Publication
Recommended article: A new bound for the connectivity of cages
Recommended article: On upper bounds and connectivity of cages
Recommended article: Q5442382
Recommended article: Q3378255
Recommended article: On the connectivity of semiregular cages
Recommended article: On the connectivity of \((k,g)\)-cages of even girth
Recommended article: Q3105526
Recommended article: Q5443277
Recommended article: Q4853718
Recommended article: Mixed cages: monotonicity, connectivity and upper bounds
description: scientific article; zbMATH DE number 1907105