Please use this identifier to cite or link to this item:
http://13.232.72.61:8080/jspui/handle/123456789/545Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Jyothi, P. Vijaya | - |
| dc.contributor.author | Kelkar, Indrani | - |
| dc.contributor.author | Maheswari, B. | - |
| dc.date.accessioned | 2018-12-06T12:20:22Z | - |
| dc.date.available | 2018-12-06T12:20:22Z | - |
| dc.date.issued | 2014-04 | - |
| dc.identifier.citation | Jyothi, P. Vijaya., Kelkar, Indrani., & Maheswari, B. (2014). K-Domination Number of Butterfly Graphs. IOSR Journal of Engineering, 4(4), 23-27. | en_US |
| dc.identifier.issn | e-2250-3021 | - |
| dc.identifier.issn | p-2278-8719 | - |
| dc.identifier.uri | http://13.232.72.61:8080/jspui/handle/123456789/545 | - |
| dc.description.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. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | IOSRJEN | en_US |
| dc.subject | Mathematics | en_US |
| dc.subject | Butterfly graph | en_US |
| dc.subject | k-domination number | en_US |
| dc.title | K - Domination Number of Butterfly Graphs. | en_US |
| dc.type | Article | en_US |
| 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.