Наукова електронна бібліотека
періодичних видань НАН України
періодичних видань НАН України
Total global neighbourhood domination
Репозиторій DSpace/Manakin
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Siva Rama Raju, S.V. | |
| dc.contributor.author | Nagaraja Rao, I.H. | |
| dc.date.accessioned | 2019-06-18T18:19:40Z | |
| dc.date.available | 2019-06-18T18:19:40Z | |
| dc.date.issued | 2017 | |
| dc.identifier.citation | Total global neighbourhood domination / S.V. Siva Rama Raju, I.H. Nagaraja Rao // Algebra and Discrete Mathematics. — 2017. — Vol. 24, № 2. — С. 320-330. — Бібліогр.: 8 назв. — англ. | uk_UA |
| dc.identifier.issn | 1726-3255 | |
| dc.identifier.other | 2010 MSC:05C69. | |
| dc.identifier.uri | http://dspace.nbuv.gov.ua/handle/123456789/156643 | |
| dc.description.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. | uk_UA |
| dc.language.iso | en | uk_UA |
| dc.publisher | Інститут прикладної математики і механіки НАН України | uk_UA |
| dc.relation.ispartof | Algebra and Discrete Mathematics | |
| dc.title | Total global neighbourhood domination | uk_UA |
| dc.type | Article | uk_UA |
| dc.status | published earlier | uk_UA |
