Algorithms for Determining the Cyclic Edge Connectivity of Cubic Graphs

Abstract

In this paper, by proof we directly got the value of cyclic edge connectivity of some cubic graphs such that an algorithm determining the cyclic edge connectivity of cubic graphs was improved. We also added randomness to the algorithm determining cyclic edge connectivity of cubic graphs, although the effect was not ideal. But this method can be used to determine cyclic edge connectivity of general graphs if we can determine the upper bound of cyclic edge connectivity in general graphs. Combining randomized algorithms with the cyclic edge connectivity of graphs is a new attempt.