The linear vertex-arboricity ρ(G) of a graph G is defined to be the minimum number of subsets into which the vertex set of G can be partitioned such that each subset induces a linear forest. In this paper, we give the sharp upper and lower bounds for the sum and product of linear vertex-arboricities of a graph and its complement. Specifically, we prove that for any graph G of order p. and for any graph G of order p = (2n + 1)2, where n ? Z+, 2n + 2 ≦ ρ(G) + ρ(G ).