1. IR @ Gulbarga University
  2. Faculty Publications
  3. 1. Journal Articles
Please use this identifier to cite or link to this item: http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/4339
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKulli V.R
dc.contributor.authorIyer R.R.
dc.date.accessioned2020-06-12T15:03:38Z-
dc.date.available2020-06-12T15:03:38Z-
dc.date.issued2012
dc.identifier.citationJournal of Discrete Mathematical Sciences and Cryptography , Vol. 15 , 6 , p. 389 - 393en_US
dc.identifier.uri10.1080/09720529.2012.10698391
dc.identifier.urihttp://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/4339-
dc.description.abstractLet G = (V,E) be a graph. Let D be a minimum vertex covering of G. If V - D contains a vertex cover D? of G, then D? is called an inverse vertex cover with respect to D. The inverse vertex covering number ?0-1(G) of G is the minimum cardinality of an inverse vertex cover of G. In this paper, we initiate a study of this new parameter and establish some results on this parameter. © Taru Publications.en_US
dc.subjectDomination number
dc.subjectInverse vertex covering number
dc.subjectVertex covering number
dc.titleInverse vertex covering number of a graphen_US
dc.typeArticle
Appears in Collections:1. Journal Articles

Files in This Item:
There are no files associated with this item.
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.