On separating systems of graphs
✍
CAI Mao-cheng
📂
Article
📅
1984
🏛
Elsevier Science
🌐
English
⚖ 208 KB
Given a finite loopless graph G (resp. digraph D), let ~r(G), q~(G) and ~k(D) denote the minimal cardinalities of a completely separating system of (3, a separating system of G and a separating system of D, respectively. The main results of this paper are: (i) o'(G) =rain m Lm/2J ~'y(G) and ~0(G)= [