Domination Parameters in Coronene Torus Network

Abstract

A set D of vertices in a graph G is said to be a dominating set if every vertex in V − D is adjacent to some vertex in D. A subset D of V is a paired-dominating set of G, if D is a dominating set and the subgraph induced by the vertices of D contains a perfect matching. A set D of a vertices in a graph G = (V, E) is said to be a total dominating set of G if every vertex in V is adjacent to some vertex in D. The total bondage number b t (G) of G is the minimum number of edges whose removal enlarges the total domination number. In this paper we determine the domination number, paired-domination number, bondage number and the total bondage number for coronene torus using H -packing.