engleski

Upper bound for total domination number on linear and double hexagonal chains

For any graph G by V (G) and E(G) we denote the vertex-set and the edge-set of G, respectively. For graph G subset D of the vertex-set of G is called a total dominating set if every vertex v in V (G) is adjacent to at least one vertex of D. The total domination number gamma_t(G) is the cardinality of the smallest total dominating set. In this paper we examine total dominations on linear and double hexagonal chains and determine upper bound for total domination numbers for such graphs.

total dominating set; total dominating number; linear hexagonal chain; double hexagonal chain

nije evidentirano