Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.13/809116
- Title
- On the number of components of (k, g)-cages after vertex deletion
- Author/Creator
-
Lin, Yuqing;
Balbuena, Camino;
Miller, Mirka
- Institution
- The University of Newcastle. Faculty of Engineering & Built Environment, School of Electrical Engineering and Computer Science
- 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.
- Relation
- Discrete Applied Mathematics Vol. 157, Issue 8, p. 1760-1765
- Publisher Link
- http://dx.doi.org/10.1016/j.dam.2008.12.005
- Date
- 2009
- Publisher
- Elsevier
- Keyword(s)
-
cages;
connectivity;
disconnecting set
- Resource Type
- journal article
- Identifier
- http://hdl.handle.net/1959.13/809116
- Identifier
- ISSN:0166-218X
- Reviewed
-
-
14 Visitors
23 Hits
2 Downloads
