TARU PUBLICATIONS
Journal of Information and Optimization Sciences cover
Open Access ·Peer-reviewed·ISSN (Online): 2169-0103·ISSN (Print): 0252-2667

WoS  JIF 2026 : 0.4 (Q4)

Powered by:Powered by

Monthly Journal: Publishes theoretical and applied research on topics in information and optimization sciences.

Issues up to 2022 co-published with and available at:Taylor & Francis
submissions@tarupublications.com
Open Access Research Article

Independent semitotal domination in graphs

* ,

* Corresponding author · click or hover a name for details

pp. 145–156Vol. 45Issue 1January 2024DOI: 10.47974/JIOS-1397XML
Received:
08 Nov 2022
Published Online:
05 Feb 2024
Article type:
Research Article
Language:
EN
Article no.:
JIOS-1397
Pages:
145–156

Abstract

In this paper a slight different parameter, independent semitotal domination number- git2(G) is introduced. This parameter lies between i(G) and b0(G)  of a graph. We initiate a study on this parameter git2(G).  We construct graphs for prescribed gt(G) and git2(G).  Also we determine bounds for git2  value of graphs.

Keywords

Subject Classifications

(2010) 05C69

References

[1] Benecke.S.,Cockayne.E.J. and Mynhardt.C.M, Secure total domination in graphs, Util.Math 74(2007), pp.247-259. 
[2] Berge.C.,Theory of Graphs and its Applications, Methuen, London, 1962. 
[3] Cockayne.E.J., Hedetniemi.S.T., Miller.K.J., Properties of hereditary hypergraphs and middle graphs, Canad. Math. Bull. 21(1978), pp.461-468. 
[4] Enriquez.E.L. and Kiunisala.E.M., Inverse Secure Domination in Graphs, Global Journal of Pure and Applied Mathematics, 12(1)(2016) 147-155. 
[5] Goddard.W., Henning.M.A. and McPillan.C.A., Semitotal domination in graphs, Util. Math., 94(2014), pp.67-81. 
[6] Harary. F., Graph Theory, Addision-Wesley, Reading, Mass, 1972. 
[7] Haynes.T.W., Hedetniemi.S.T. and Slater.P.J., Fundamentals of domination in graphs, Marcel Dekker, New york,1998. 
[8] Haynes.T.W., Hedetniemi.S.T. and Slater.P.J. Domination in Graphs: Advanced Topics, Marcel Dekker, New york,1998. 
[9] Henning.M.A. and Marcon.A.J., On matching and semitotal domination in graphs, Discrete Math. 324(2014), pp.13-18. 
[10] Henning.M.A. and Marcon.A.J., Semitotal domination in claw-free cubic graphs, Ann.Comb. 20(4)(2016),pp.799-813.
[11] Kulli.V.R., Chaluvaraju.B. and Kumara.M., Graphs with equal secure total domination and inverse secure total domination numbers, Journal of Information and Optimization Sciences, 39:2(2018), 467-473, DOI:10.1080/02522667.2017.1379233. 
[12] Qin chen and yunfang Tang., Semitotal domination subdivision numbers of graphs, Journal of Discrete Mathematical Sciences and Cryptography, 23:5(2020), 973-987, DOI:10.1080/09720529.2019.1645393. 
[13] Sahul Hamid.I. and Balamurugan. S., Isolate domination in graphs, Arab J Math Sci 22(2016), pp.232-241. 
[14] S.Velammal, Studies in Graph Theory: Covering, Independence, Domination and Related Topics, Ph.D.Thesis, Manonmaniam Sundaranar University,Tirunelveli 1997. 
[15] Zhuang.W. and Hao.G., Semitotal domination in trees, Discrete Math. Theor. Comput. Sci., 20(2)(2018), ID: dmts:4413.

Views: 254Downloads: 126Citations: 0