International Journal of Mathematics Trends and Technology
Volume 65 | Issue 4 | Year 2019 | Article Id. IJMTT-V65I4P515 | DOI : https://doi.org/10.14445/22315373/IJMTT-V65I4P515
A total dominating set D of graph G = (V, E) is a total strong split dominating set if the induced sub graph < V−D > is totally disconnected with at least two vertices. The total strong split domination number γtss(G) is the minimum cardinality of a total strong split dominating set. In this paper, we introduce the concept 𝛾𝑡𝑠𝑠 − graph of a graph G and define the graph G(𝛾𝑡𝑠𝑠) = (V(𝛾𝑡𝑠𝑠 ), E(𝛾𝑡𝑠𝑠 )) of G to be the graph whose vertices V(𝛾𝑡𝑠𝑠 ) corresponds injectively with the 𝛾𝑡𝑠𝑠 −sets of a graph G and two 𝛾𝑡𝑠𝑠 −sets D1 and D2 form an edge in G(𝛾𝑡𝑠𝑠 ) if there exists a vertex v ∈ D1 and w ∈ D2 such that v is adjacent to w and D1 = D2 – {w} ∪ {v} or equivalently D2 = D1 – {v} ∪ {w}. With this definition, two 𝛾𝑡𝑠𝑠 −sets are said to be adjacent if they differ by one vertex, and the two vertices defining this difference are adjacent in G. We also determine G(𝛾𝑡𝑠𝑠 ) of some graphs.
[1] Gerd. H. Fricke, Sandra. M, Hedetniemi, Stephen Hedetniemi and Kevin R. Hutson, γ−graph on Graphs, Discuss Math Graph Theory n31 (2011) 517−531.
[2] Harary. F, Graph Theory, Addison−Wesley, Reading, MA, 1972.
[3] Janakiraman. B, Soner. N. D and Chaluvaraju. B, Total Split Domination in Graphs, Far East J.Appl. Math. 6(2002) 89−95.
[4] Kulli.V. R and Janakiram. B, The Strong Split Domination Number of a Graph, Acta Ciencia Indica, Vol. XXXII M, No. 2 (2006) 715−720.
[5] T.Nicholas and T. Sheeba Helen, The Total Strong Split Domination Number of Graphs, International Journal of Mathematics and Statistics Invention, Vol.5 Issue 2(1-3) February 2017.
T.Sheeba Helen, T.Nicholas, "A Note on G(γτss) of Some Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 65, no. 4, pp. 80-83, 2019. Crossref, https://doi.org/10.14445/22315373/IJMTT-V65I4P515
PDF 
Abstract 
Keywords 
References 
Citation