Cubic Graphs with Total Domatic Number at Least Two

• Autorzy: Saieed Akbari , Mohammad Motiei , Sahand Mozaffari , Sina Yazdanbod
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

total domination; total domatic number; coupon coloring

Kategorie tematyczne

• 05C15: Coloring of graphs and hypergraphs
• 05C69: Dominating sets, independent sets, cliques

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2017
• Tom: 38
• Numer: 1
• Strony: 75-82

Daty

wydano

2018-02-01

otrzymano

2016-02-26

poprawiono

2016-09-28

zaakceptowano

2016-09-28

online

2017-12-30

Twórcy

autor

Saieed Akbari

• ,

autor

Mohammad Motiei

• ,

autor

Sahand Mozaffari

• ,

autor

Sina Yazdanbod

• ,

Identyfikatory

DOI

10.7151/dmgt.1996