Please use this identifier to cite or link to this item:
http://13.232.72.61:8080/jspui/handle/123456789/545| Title: | K - Domination Number of Butterfly Graphs. |
| Authors: | Jyothi, P. Vijaya Kelkar, Indrani Maheswari, B. |
| Keywords: | Mathematics Butterfly graph k-domination number |
| Issue Date: | Apr-2014 |
| Publisher: | IOSRJEN |
| Citation: | Jyothi, P. Vijaya., Kelkar, Indrani., & Maheswari, B. (2014). K-Domination Number of Butterfly Graphs. IOSR Journal of Engineering, 4(4), 23-27. |
| Abstract: | Butterfly graphs and domination are very important ideas in computer architecture and communication techniques. We present results about one important domination parameter k-domination Number for Butterfly Graph. We find the relation between domination number and k-domination number for BF(n). In this paper we present results about k-domination number of Butterfly Graphs BF(n). We show that domination number and k-domination number of butterfly graphs BF(n) are related to each other as k (BF(n)) > (BF(n)) except for k = 2 and n = 6. |
| URI: | http://13.232.72.61:8080/jspui/handle/123456789/545 |
| ISSN: | e-2250-3021 p-2278-8719 |
| Appears in Collections: | Articles |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| K - Domination Number of Butterfly Graphs..pdf | 23.5 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.