ON RELATIONS BETWEEN THE COVERING NUMBER OF A GRAPH AND ITS COMPLEMENTARY GRAPH
张忠辅 · 中国科学通报：英文版 · 1989
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, and