Domination theory is required for encryption of binary string into a DNA sequence. A 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. The bondage number b(G) of a nonempty graph G is the minimum number of edges whose removal from G results in a graph with larger domination number than γ(G). In this paper we determine the domination number and the bondage number for pyrene torus, Balaban 10-cage and hexabenzocoronene using H-packing. Further we compute the domination number of non-isomorphic graphs with same number of vertices namely H-phenylenic nanotube and H-napthelenic nanotube. © 2014, Springer International Publishing Switzerland.