GULBARGA UNIVERSITY, KALABURAGI Institutional Repository
Please use this identifier to cite or link to this item:
http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5366Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kulli V.R | |
| dc.contributor.author | Janakiram B. | |
| dc.date.accessioned | 2020-06-12T15:07:56Z | - |
| dc.date.available | 2020-06-12T15:07:56Z | - |
| dc.date.issued | 2000 | |
| dc.identifier.citation | Indian Journal of Pure and Applied Mathematics , Vol. 31 , 5 , p. 545 - 550 | en_US |
| dc.identifier.uri | http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5366 | - |
| dc.description.abstract | A dominating set D of graph G = (V, E) is a nonsplit dominating set if the induced subgraph ? V-D ? is connected. The nonsplit domination number ?ns (G) of G is the minimum cardinality of a nonsplit dominating set. In this paper, many bounds on ?ns (G) are obtained and its exact values for some standard graphs are found. Also its relationship with other parameters is investigated. | en_US |
| dc.subject | Graph | |
| dc.subject | Nonsplit domination number | |
| dc.title | The nonsplit domination number of a graph | en_US |
| dc.type | Article | |
| Appears in Collections: | 1. Journal Articles | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.