SEMIGLOBAL TOTAL DOMINATION IN GRAPHS

T. Nicholas, T. Sheeba Helen

Abstract


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 Gsc 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.


Keywords


Semicomplete graph, global total domination number, semicomplementary graph, semiglobal total domination number.

Full Text:

PDF

References


R.C.Brigham and R.D.Dutton, Factor domination in graphs, Discrete Math 86(1990)127-136.

C.J Cockayne, R.M. Dawes and S.T. Hedetniemi, Total Domination in Graphs, Networks, 10 (1980) 211-219.

J.Deva Raj,V.Sujin Flower, A note on Global Total Domination in Graphs, Bulletin of Pure and Applied Sciences Volume 30 E (Math & Stat )Issue (No:1) 2011 P.63 – 70.

Harary, F. Graph Theory, Addison - Wesley, Reading, MA, 1972.

T. W. Haynes, S. T. Hedetneimi, P. J. Slater, Fundamentals of Domination in Graphs, MarcelDekker, New York, 1988.

I. H. Naga Raja Rao, S. V. Siva Rama Raju, Semi Complementary Graphs, Thai Journal of Mathematics. Volume 12 (2014) number 1: 175 – 183.

E. Sampathkumar, The global domination number of a graph J.MathPhys.Sci 23 (1989) 377-385.


Refbacks

  • There are currently no refbacks.


Copyright (c) 2017 Journal of Progressive Research in Mathematics

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

Copyright © 2016 Journal of Progressive Research in Mathematics. All rights reserved.

ISSN: 2395-0218.

For any help/support contact us at editorial@scitecresearch.com, jprmeditor@scitecresearch.com.