Star number and star arboricity of a complete multigraph

Let G be a multigraph. The star number s(G) of G is the minimum number of stars needed to decompose the edges of G. The star arboricity sa(G) of G is the minimum number of star forests needed to decompose the edges of G. As usual λK _n denote the λ-fold complete graph on n vertices (i.e., the multigraph on n vertices such that there are λ edges between every pair of vertices). In this paper, we prove that for n ≥ 2 Equation presented.