A k-HAMILTON-NICE SEQUENCE  

作　　者：刘一平 田丰 吴正声 

机构地区：[1]Department of Mathematics, Nanjing Normal University, Nanjing 210024, PRC [2]Institute of Systems Science, Academia Sinica, Beijing 100080, PRC

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

基　　金：Project supported by the National Natural Science Foundation of China.

摘　　要：Let G be an undirected simple graph, t be a positive integer. Write; Y is an independent set of G, |Y|=t}. For Y∈I_t(G), i∈{0, 0, …, t}, set S_i(Y):={v∈V(G); |N(v)∩Y|=i}, s_i(Y):=|S_i(Y)|. In 1990, Chen Guan-tao et al. introduced the following definition.<正> Let G be an undirected simple graph, t be a positive integer. Write; Y is an independent set of G, |Y|=t}. For Y∈I_t(G), i∈{0, 0, …, t}, set S_i(Y):={v∈V(G); |N(v)∩Y|=i}, s_i(Y):=|S_i(Y)|. In 1990, Chen Guan-tao et al. introduced the following definition.

关 键 词：undirected INTEGER CONNECTED stated RATIONAL 

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