Department of Computer Science, Zhongshan University, Guangzhou 510275, PR China
Abstract:
In this paper, we characterize the graphs with infinite cyclic edge connectivity. Then we design an efficient algorithm to determine whether a graph has finite cyclic edge connectivity or infinite cyclic edge connectivity.