Loading...

On double-star decomposition of graphs

Akbari, S ; Sharif University of Technology | 2017

383 Viewed
  1. Type of Document: Article
  2. DOI: 10.7151/dmgt.1933
  3. Publisher: University of Zielona Gora , 2017
  4. Abstract:
  5. A tree containing exactly two non-pendant vertices is called a doublestar. A double-star with degree sequence (k1 +1, k2 +1, 1, ⋯ , 1) is denoted by Sk1,k2 . We study the edge-decomposition of graphs into double-stars. It was proved that every double-star of size k decomposes every 2k-regular graph. In this paper, we extend this result by showing that every graph in which every vertex has degree 2k + 1 or 2k + 2 and containing a 2-factor is decomposed into Sk1,k2 and Sk1-1,k2 , for all positive integers k1 and k2 such that k1 + k2 = k
  6. Keywords:
  7. Bipartite graph ; Double-stars ; Graph decomposition
  8. Source: Discussiones Mathematicae - Graph Theory ; Volume 37, Issue 3 , 2017 , Pages 835-840 ; 12343099 (ISSN)
  9. URL: http://www.discuss.wmie.uz.zgora.pl/gt/index.php?doi=10.7151/dmgt.1933