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/4958
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKulli V.R
dc.contributor.authorIyer R.R.
dc.date.accessioned2020-06-12T15:05:48Z-
dc.date.available2020-06-12T15:05:48Z-
dc.date.issued2007
dc.identifier.citationJournal of Discrete Mathematical Sciences and Cryptography , Vol. 10 , 5 , p. 613 - 620en_US
dc.identifier.uri10.1080/09720529.2007.10698143
dc.identifier.urihttp://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/4958-
dc.description.abstractLet G=(V, E) be a graph. Let D be a minimum total dominating set of G. If V–D contains a total dominating set D’ of G, then D’ is called an inverse total dominating set with respect to D. The inverse total domination number (Formula presented.) of G is the minimum number of vertices in an inverse total dominating set of G. We initiate the study of inverse total domination in graphs and present some bounds and some exact values for (Formula presented.). Also, some relationships between (Formula presented.) and other domination parameters are established. © 2007 Taylor & Francis Group, LLC.en_US
dc.subjectDomination
dc.subjectInverse domination
dc.subjectInverse total domination
dc.subjectTotal domination
dc.titleInverse total domination in graphsen_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.