| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650501 | Discrete Mathematics | 2008 | 10 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Dingjun Lou, Wei Wang,