For a connected graph X=(V,E),an edge set F ⊆ E is a k-restricted edge cut if X-F is disconnected such that every component of X-F has at least k vertices.The k-restricted edge connectivity λk(X)of the graph X is the cardinality of a minimum k-restricted edge cut of X.The article provides the 3-restricted edge connectivity and the λ3-optimal of the mixed Cayley graphs.
万方数据
