Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have