Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/4559
Title: Total global neighbourhood domination
Authors: S. V. S. R., Raju
Keywords: semi complete graph
total dominating set
connected dominating set.
Issue Date: 2017
Series/Report no.: математичні науки;
Abstract: A subset D of the vertex set of a connected graph G is called a total global neighbourhood dominating set(tgnd-set) of G if and only if D is a total dominating set of G as well as GN , where GN is the neighbourhood graph of G. The total global neighbourhood domination number(tgnd-number) is the minimum cardinality of a total global neighbourhood dominating set of G and is denoted by γtgn(G). In this paper sharp bounds for γtgn are obtained. Exact values of this number for paths and cycles are presented as well. The characterization result for a subset of the vertex set of G to be a total global neighbourhood dominating set for G is given and also characterized the graphs of order n(> 3) having tgnd-numbers 2, n − 1, n.
Description: Raju S.V.S.R.Total global neighbourhood domination / S.V.S.R. Raju, I.H.N. Rao // Algebra and Discrete Mathematics. - 2017. - Vol. 24. - Number 2. - Рp. 320-330
URI: http://hdl.handle.net/123456789/4559
Appears in Collections:Algebra and Discrete Mathematics. - № 2 (24). - 2017

Files in This Item:
File Description SizeFormat 
86-2038-1-PB.pdf324.61 kBAdobe PDFView/Open


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