If deleting the edge set E of a graph G,there are at least two connected branches with loops,then E is called the edge cut of graph G,and the graph with edge cuts is called separable.For a sep-arable graph G,the cardinality of the minimum circle edge cut is called the circle edge connectivity λc(G).If any minimum loop edge cut is removed,there will always be a connected branch that is the minimum loop,and then graph G is hyper loop edge connected.Using the method of proof by contradiction,it is found that k(≥4)regular bipartite graph with a circumference of g(G)≥6 is hyper-cyclic edge connected.
维普
万方数据