Please use this identifier to cite or link to this item:
http://localhost:8080/xmlui/handle/123456789/1153
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Brindha T | - |
dc.contributor.author | Subiksha R | - |
dc.date.accessioned | 2020-08-26T07:28:46Z | - |
dc.date.available | 2020-08-26T07:28:46Z | - |
dc.date.issued | 2020 | - |
dc.identifier.issn | Print:1857-8365 | - |
dc.identifier.issn | Online:1857-8438 | - |
dc.identifier.uri | https://doi.org/10.37418/amsj.9.3.11 | - |
dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/1153 | - |
dc.description.abstract | A dominating set for a graph G = (V,E) is a subset D of V such 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 introduced. A dominating set is called split total dominating set if <V-D> is disconnected and every vertex v in V is adjacent to an element of D. The split total domination number is given by st(G). We considered 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 numbers have been obtained. | en_US |
dc.language.iso | en | en_US |
dc.publisher | ADV MATH SCI JOURNALAdvances in Mathematics: Scientific Journal 9 (2020), no.3, 831–837 | en_US |
dc.subject | Split dominating set | en_US |
dc.subject | Total dominating set | en_US |
dc.subject | Split total dominating set | en_US |
dc.title | BOUNDS ON SPLIT TOTAL DOMINATION NUMBER OF GRAPHS | en_US |
dc.type | Article | en_US |
Appears in Collections: | National Journals |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
BOUNDS ON SPLIT TOTAL DOMINATION NUMBER OF GRAPHS.docx | 10.66 kB | Microsoft Word XML | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.