In this paper, the following results are obtained: a(G) + beta(G)less than or equal to p + 1, [p/2] less than or equal to a(G)beta(G), [p/2] less than or equal to a'(G) + beta'((G) over bar) less than or equal to p, a'(G) + alpha'((G) over bar) less than or equal to 2[p/2] (delta greater than or equal to 1) and all bounds are sharp, where p=V(G), [x] denotes the smallest integer greater than or equal to x, a(G) is the vertex arboricity, a'(G) is the edge arboricity, alpha'(G) is the edge covering number, beta(G) is the vertex independent number, beta'(G) is the edge independent number, and delta is the minimum degree of G. (C) 1998 Elsevier Science B.V. All rights reserved. [References: 7]
展开▼
