Let the vertex arboricity of G be denoted by a(G)and the edge arboricityof G by a1(G).For any simple nontrivial graph G of order p and its complement G, the following inequalities of Nordhaus-Gaddum class are obtained|x| and |x | denote the floor and the ceiling functions of x, respectively. It is also shownthat the upper bound in (iii) and the lower bounds in (i), (ii), and (iv) are sharp for everypositive integer p.
| 
推荐 
点击下列相关研究机构和相关文献作者，可以直接查到这些机构和作者被《中国知识资源总库》收录的其它文献，使您全面了解该机构和该作者的研究动态和历史。
