科研之友
微信
新浪微博
Facebook
分享链接
摘要
A graph X is max-lambda if lambda(X) = delta(X). A graph X is super-lambda if X is max-lambda 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 max-lambda and super-lambda.
