Accurate Domination Number of Butterfly Graph
CJM Vol. 1 No. 1 (June 2009), pp. 35 – 43.
Abstract:
Butterfly graphs and domination are very important ideas in computer architecture and communication techniques. We present results about one important domination parameter Accurate Domination Number for Butterfly Graph. We find the relation between domination number and accurate domination number for $BF(n).$
In this paper we present results about Accurate Domination Number of Butterfly Graphs $BF(n).$ We show that Domination number and accurate domination number of butterfly graphs $BF(n)$ are related to each other as
$\gamma_a(BF(n)) = \gamma(BF(n)) + 1$ if $n = 2, 3, 4k$
$\gamma_a(BF(n)) = \gamma(BF(n))$ if $n \ne 4k$.
2000 Mathematics Subject Classification:
Full Paper (PDF):
| Attachment | Size |
|---|---|
 CJM-Vol1-No1-20-May-pp035-044.pdf | 253.8 KB |