ON RELATIONS BETWEEN THE COVERING NUMBER OF A GRAPH AND ITS COMPLEMENTARY GRAPH  

作　　者：张忠辅 

机构地区：[1]Lanzhou Railway Institute

出　　处：《Chinese Science Bulletin》1989年第14期1226-1226,共1页

摘　　要：Let G(V, E) be a simple graph, A_T(?)VUE. A_T is called a total covering of G, if (?)x∈VUE, it holds that x∈A_T or xy∈A_T(y∈V\A_T) or x∈E, u∈A_T, v∈V\A_T, uv=x; A_T is called a minimum total covering, if|A_T~′|≥|A_T| for any total covering A_T~′; furthermore, |A_T| is called the total covering number of G,

关 键 词：COVERING furthermore holds EXCEEDING umber INTEGER smallest GREATEST 

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