On separating systems of graphs
暂无分享,去创建一个
Given a finite loopless graph G (resp. digraph D), let @s(G), @f(G) and @j(D) denote the minimal cardinalities of a completely separating system of G, a separating system of G and a separating system of D, respectively. The main results of this paper are: @d(G) = minm^m"@?"m"/"2"@?>=@c(G)and @f(G) = @?log"2 @c(G)@? where @c(G) denotes the chromatic number of G. (ii) All the problems of determining @s(G), @f(G) and @j(D) are NP-complete.
[1] Andrew Chi-Chih Yao. On a problem of Katona on minimal separating systems , 1976, Discret. Math..
[2] Joel Spencer,et al. Minimal completely separating systems , 1970 .
[3] T. J. Dickson. On a problem concerning separating systems of a finite set , 1969 .
[4] Cai Mao-cheng. Solutions to Edmonds' and Katona's problems on families of separating subsets , 1983 .