Article ID Journal Published Year Pages File Type
420557 Discrete Applied Mathematics 2009 6 Pages PDF
Abstract

A (k,g)(k,g)-cage is a kk-regular graph of girth gg and with the least possible number of vertices. In this paper, we investigate the problem of how many connected components there will be after removing a cutset of up to kk vertices from a (k,g)(k,g)-cage.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
On the number of components of (k,g)(k,g)-cages after vertex deletion
Authors
, , ,