Note: Super edge-connectivity of mixed Cayley graph

Discrete Mathematics(2009)

引用 6|浏览2
暂无评分
摘要
graph X is [email protected] if @l(X)[email protected](X). A graph X is [email protected] if X is [email protected] and every minimum edge-cut set of X isolates one vertex. In this paper, we proved that for all but a few exceptions, the mixed Cayley graph which is defined as a new kind of semi-regular graph is [email protected] and [email protected]
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要