LOWER BOUND OF CONNECTIVITY IN CIRCULAR GRAPHS  

作　　者：周永生 李唐芬 

机构地区：[1]Gansu University of Technology, Lanzhou 730050, PRC

出　　处：《Chinese Science Bulletin》1991年第18期1579-1579,共1页

摘　　要：Let D denote a diconnected digraph and D(n, S)denote a connected circular digraph.Suppose CV(D). If D-C is not a diconnected digraph or is a single vertex, then C is called vertex cutset of D. We denote all vertex outsets of D by B(D).

关 键 词：VERTEX CONNECTED CIRCULAR 

分 类 号：N[自然科学总论]