Tree Derived Architectures with Decycling Number Equal to Cycle Packing Number

D. Paul, Indra Rajasingh, R. Sundara Rajan
2015 Procedia Computer Science  
The decycling number of a graph G , denoted by ) (G , is the smallest number of vertices that can be deleted from G so that the resultant graph contains no cycles. The cycle packing number of a graph G denoted by We find certain networks for which decycling number equals the cycle packing number.
doi:10.1016/j.procs.2015.07.460 fatcat:fgmrpahnb5g6fndrqxjubve3my