Please use this identifier to cite or link to this item:
http://13.232.72.61:8080/jspui/handle/123456789/572Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kelkar, Indrani | - |
| dc.contributor.author | Maheswari, B. | - |
| dc.date.accessioned | 2018-12-07T13:52:02Z | - |
| dc.date.available | 2018-12-07T13:52:02Z | - |
| dc.date.issued | 2014-08 | - |
| dc.identifier.citation | Kelkar, Indrani., & Maheswari, B. (2014). Total Domination Number of Butterfly Graph. International Journal of Engineering and Management Research, 4(4), 91-93. | en_US |
| dc.identifier.issn | 2250-0758 | - |
| dc.identifier.uri | http://13.232.72.61:8080/jspui/handle/123456789/572 | - |
| dc.description.abstract | Butterfly graphs are very important structures in computer architecture and communication techniques. Total Domination is an important parameter as it ensures connectivity in the network even after failure of few of the communication points. In this paper we find total domination number of BF(n) and deduce a relation between the domination number and total domination number of BF(n) as t (BF(2)) = 22 = (BF(2)) + 2 t (BF(3)) = 23 = (BF(3)) + 2 t (BF(n)) = (BF(n)) for n > 3. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | IJEMR | en_US |
| dc.subject | Mathematics | en_US |
| dc.subject | Butterfly graph | en_US |
| dc.subject | Domination number | en_US |
| dc.title | Total Domination Number of Butterfly Graph. | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | Articles | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Total Domination Number of Butterfly graph-2-4.pdf | 458.35 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.