### Abstract

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.

Original language | English |
---|---|

Pages (from-to) | 961-967 |

Number of pages | 7 |

Journal | Czechoslovak Mathematical Journal |

Volume | 56 |

Issue number | 3 |

DOIs | |

Publication status | Published - 2006 Sep 1 |

Externally published | Yes |

### Fingerprint

### Keywords

- Complete multigraph
- Decomposition
- Star arboricity
- Star forest

### ASJC Scopus subject areas

- Mathematics(all)