A benzenoid is a molecule that can be represented as a graph. This graph is a fragment of the hexagon lattice. A dominating set $D$ in a graph $G$ is a set of vertices such that each vertex of the graph is either in $D$ or adjacent to a vertex in $D$. The domination number $\gamma=\gamma(G)$ of a graph $G$ is the size of a minimum dominating set. We will find formulas and bounds for the domination number of various special benzenoids, namely, linear chains $L(h)$, triangulenes $T_k$, and parallelogram benzenoids $B_{p,q}$. The domination ratio of a graph $G$ is $\frac{\gamma(G)}{n(G)}$, where $n(G)$ is the number of vertices of $G$. We will use the preceding results to prove that the domination ratio is no more than $\frac{1}{3}$ for the considered benzenoids. We conjecture that is true for all benzenoids.
| Identifer | oai:union.ndltd.org:vcu.edu/oai:scholarscompass.vcu.edu:etd-3117 |
| Date | 07 May 2010 |
| Creators | Bukhary, Nisreen |
| Publisher | VCU Scholars Compass |
| Source Sets | Virginia Commonwealth University |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Theses and Dissertations |
| Rights | © The Author |
Page generated in 0.0017 seconds