Loading...

Cubic graphs with total domatic number at least two

Akbari, S ; Sharif University of Technology | 2018

107 Viewed
  1. Type of Document: Article
  2. DOI: 10.7151/dmgt.1996
  3. Publisher: University of Zielona Gora , 2018
  4. Abstract:
  5. Let G be a graph with no isolated vertex. A total dominating set of G is a set S of vertices of G such that every vertex is adjacent to at least one vertex in S. The total domatic number of a graph is the maximum number of total dominating sets which partition the vertex set of G. In this paper we provide a criterion under which a cubic graph has total domatic number at least two
  6. Keywords:
  7. Coupon coloring ; Total domatic number ; Total domination
  8. Source: Discussiones Mathematicae - Graph Theory ; Volume 38, Issue 1 , 2018 , Pages 75-82 ; 12343099 (ISSN)
  9. URL: https://www.dmgt.uz.zgora.pl/publish/view_pdf.php?ID=-1045