Total global neighbourhood domination
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 min...
Saved in:
| Date: | 2017 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Інститут прикладної математики і механіки НАН України
2017
|
| Series: | Algebra and Discrete Mathematics |
| Online Access: | http://dspace.nbuv.gov.ua/handle/123456789/156643 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Cite this: | Total global neighbourhood domination / S.V. Siva Rama Raju, I.H. Nagaraja Rao // Algebra and Discrete Mathematics. — 2017. — Vol. 24, № 2. — С. 320-330. — Бібліогр.: 8 назв. — англ. |