Downloads provided by UsageCounts
A subset D of vertices of a connected graph G is called a semiglobal total dominating set if D is a dominating set for G and G sc and < D > has no isolated vertex in G, where Gsc is the semi complementary graph of G. The semiglobal total domination number is the minimum cardinality of a semiglobal total dominating set of G and is denoted by γsgt(G). In this paper exact values for γsgt(G) are obtained for some graphs like cycles, wheel and paths are presented as well.
Semicomplete grap; global total domination number; semicomplementary graph; semiglobal total domination number.
Semicomplete grap; global total domination number; semicomplementary graph; semiglobal total domination number.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 2 | |
| downloads | 2 |

Views provided by UsageCounts
Downloads provided by UsageCounts