On a class of graphs with large total domination number


Bahadir S. , GÖZÜPEK KOCAMAN D.

Discrete Mathematics and Theoretical Computer Science, cilt.20, 2018 (SCI Expanded İndekslerine Giren Dergi)

  • Cilt numarası: 20 Konu: 1
  • Basım Tarihi: 2018
  • Dergi Adı: Discrete Mathematics and Theoretical Computer Science

Özet

Let gamma(G) and gamma(t) (G) denote the domination number and the total domination number, respectively, of a graph G with no isolated vertices. It is well-known that gamma(t) (G) <= 2 gamma(G). We provide a characterization of a large family of graphs (including chordal graphs) satisfying gamma(t) (G) = 2 gamma(G), strictly generalizing the results of Henning (2001) and Hou and Xu (2010), and partially answering an open question of Henning (2009).