- Title
- On the number of components of (k, g)-cages after vertex deletion
- Creator
- Lin, Yuqing; Balbuena, Camino; Miller, Mirka
- Relation
- Discrete Applied Mathematics Vol. 157, Issue 8, p. 1760-1765
- Publisher Link
- http://dx.doi.org/10.1016/j.dam.2008.12.005
- Publisher
- Elsevier
- Resource Type
- journal article
- Date
- 2009
- Description
- A (k,g)-cage is a k-regular graph of girth g 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 k vertices from a (k,g)-cage.
- Subject
- cages; connectivity; disconnecting set
- Identifier
- http://hdl.handle.net/1959.13/809116
- Identifier
- uon:7829
- Identifier
- ISSN:0166-218X
- Language
- eng
- Full Text
- Reviewed
- Hits: 665
- Visitors: 1099
- Downloads: 257
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | SOURCE1 | Author final version | 171 KB | Adobe Acrobat PDF | View Details Download |