This paper studies the following variations of arboricity of graphs. The vertex (respectively, tree) arboricity of a graph G is the minimum number va(G) (respectively, ta(G)) of subsets into which the vertices of G can be partitioned so that each subset induces a forest (respectively, tree). This paper studies the vertex and the tree arboricities on various classes of graphs for exact values, a...

we study different completeness definitions for two categories of lattice-valued cauchy spaces and the relations between these definitions. we also show the equivalence of a so-called completion axiom and the existence of a completion.

we investigate a class of fourth-order differential operators with eigenparameter dependent boundary conditions and transmission conditions. a self-adjoint linear operator a is defined in a suitable hilbert space h such that the eigenvalues of such a problem coincide with those of a . we discuss asymptotic behavior of its eigenvalues and completeness of its eigenfunctions. finally, we obtain th...