| COVERING TWO DIGRAPHS WITH ARBORESCENCES |
| |
| 引用本文： | 蔡茂诚. COVERING TWO DIGRAPHS WITH ARBORESCENCES[J]. 系统科学与复杂性, 1990, 0(3) |
| |
| 作者姓名： | 蔡茂诚 |
| |
| 作者单位： | Institute of |
| |
| 基金项目： | Work Supported by the exchange program between the Academia Sinica and the Max Planck Society |
| |
| 摘 要： | Let G_1 and G_2 be finite digraphs,both with vertex set V.Suppose that each vertexv of V has nonnegative integers f(v) and g(v) with f(v)≤g(v),and each arc e of G_4 hasnonnegative integers a_i(e) and b_i(e) with a_i(e)≤b_i(e),i=1,2.In this paper we give anecessary and sufficient condition for the existence of k arborescences in G_4 covering each are(?) of G_i at least a_i(e) and at most b_i(e) times,i=1,2,and satisfying the condition that foreach v in Vf(v)≤r_1(v)=r_2(v)≤g(v)where r_4(v) denote the number of the arborescences in G_(?) rooted at v.
|
COVERING TWO DIGRAPHS WITH ARBORESCENCES |
| |
| Cai Maocheng. COVERING TWO DIGRAPHS WITH ARBORESCENCES[J]. Journal of Systems Science and Complexity, 1990, 0(3) |
| |
| Authors: | Cai Maocheng |
| |
| Abstract: | |
| |
| Keywords: | Arborescence covering packing |
| 本文献已被 CNKI 等数据库收录！ |
|
