Please use this identifier to cite or link to this item: http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/4958
Title: Inverse total domination in graphs
Authors: Kulli V.R
Iyer R.R.
Keywords: Domination
Inverse domination
Inverse total domination
Total domination
Issue Date: 2007
Citation: Journal of Discrete Mathematical Sciences and Cryptography , Vol. 10 , 5 , p. 613 - 620
Abstract: Let 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.
URI: 10.1080/09720529.2007.10698143
http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/4958
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.