dominating set of a graph G = (V,E) is a subset D of V such that every vertex not in D is adjacent to at least one vertex in D. A dominating set D is a total dominating set, if every vertex in V is adjacent to at least one vertex in D. The set P is said to be an open packing set if no two vertices of P have a common neighbor in G. In this paper, we obtain domination number, total domination number and open packing number of the molecular graph of a new type of graphene named CorCor that is a 2-dimensional carbon network.
