Domination in certain chemical graphs

摘要

Domination theory is required for encryption of binary string into a DNA sequence. A dominating set of a graph is a subset of such that every vertex not in is adjacent to at least one vertex in . The bondage number of a nonempty graph is the minimum number of edges whose removal from results in a graph with larger domination number than . In this paper we determine the domination number and the bondage number for pyrene torus, Balaban 10-cage and hexabenzocoronene using -packing. Further we compute the domination number of non-isomorphic graphs with same number of vertices namely H-phenylenic nanotube and H-napthelenic nanotube.