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/5365Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kulli V.R | |
| dc.contributor.author | Sigarkanti S.C. | |
| dc.date.accessioned | 2020-06-12T15:07:56Z | - |
| dc.date.available | 2020-06-12T15:07:56Z | - |
| dc.date.issued | 2000 | |
| dc.identifier.citation | Journal of Interdisciplinary Mathematics , Vol. 3 , 43864 , p. 191 - 194 | en_US |
| dc.identifier.uri | 10.1080/09720502.2000.10700281 | |
| dc.identifier.uri | http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5365 | - |
| dc.description.abstract | A set D of vertices in a graph G is an mn-dominating set if for every vertex v ? D, | N(v) ? (V-D) | ? m and for every vertex u ? V -D, | N(u) ? D | ? n. The nm-domination number Ynm(G) is the order of a smallest nm-dominating set in G. In this paper, some results on nm-domination number are established. © 2000 Academic Forum. | en_US |
| dc.title | The nm-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.