Please use this identifier to cite or link to this item:
http://localhost:8080/xmlui/handle/123456789/4518
Title: | BOUNDS ON SPLIT TOTAL DOMINATION NUMBER OF GRAPHS |
Authors: | Brindha, T Subiksha, R |
Issue Date: | 2020 |
Publisher: | Advances in Mathematics: Scientific Journal |
Abstract: | A dominating set for a graph G = (V, E) is a subset D of V such that that every vertex not in D is adjacent to at least one member of D. The domination number γ(G) is the number of vertices in a smallest dominating set for G. In this paper a new parameter, split total dominating Set D has been intro-duced. A dominating set is called split total dominating set if < V − D > is disconnected and every vertex v ∈ V is adjacent to an element of D. The split total domination number is given by γst(G). We consired the split total domination number of some undirected graphs, non-trivial, connected and finite. The bounds for split total domination number and the Nordhaus-Gaddum type results on split total domination number has been discussed. Also a few results on split total domination number has been obtained. |
URI: | https://doi.org/10.37418/amsj.9.3.11 |
ISSN: | 1857-8438 |
Appears in Collections: | 2.Article (63) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
BOUNDS ON SPLIT TOTAL DOMINATION NUMBER OF GRAPHS.pdf | 189.93 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.