Back to Search
Start Over
Star decomposition of graphs.
- Source :
-
Discrete Mathematics, Algorithms & Applications . Jun2015, Vol. 7 Issue 2, p-1. 9p. - Publication Year :
- 2015
-
Abstract
- Let k be a positive integer and G be a graph. If d(u) + d(v) ≥ 4k - 3 for any uv ∈ E(G), then G admits a star decomposition in which all stars have size at least k. In particular, every graph G with δ(G) ≥ 2k - 1 admits such a decomposition. The bounds are best possible, in the sense that there exist infinitely many graphs G with δ(G) ≥ 2k - 2 and without such a decomposition. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 17938309
- Volume :
- 7
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics, Algorithms & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 108310517
- Full Text :
- https://doi.org/10.1142/S1793830915500160