Abstract

A subset S of vertices of a graph G with no isolated vertices is an independent semitotal dominating set if S is an independent dominating set, and for each u ∈ S there is a v ∈ S at a distance exactly two. The independent semitotal domination number of a graph is the minimum size of an independent semitotal dominating set of vertices in G and is denoted by γit2(G). This paper initiates the study of independent semitotal bondage number of graphs. The independent semitotal bondage number denoted by bit2(G), is the minimum number of edges whose removal from the graph increases the independent semitotal domination number. 

References

[1] Gary Chartrand, and Linda Lesniak, Graphs and Digraphs, 4^th ed., CRC Press, Boca Raton, pp. 1-386, 2005.
[Google Scholar] [Publisher Link]
[2] E.J. Cockayne, S.T. Hedetniemi, and D.J. Miller, “Properties of Hereditary Hypergraphs and Middle Graphs,” Canadian Mathematical Bulletin, vol. 21, no. 4, pp. 461-468, 1978.
[CrossRef] [Google Scholar] [Publisher Link]
[3] John Frederick Fink et al., “The Bondage Number of a Graph,” Discrete Mathematics, vol. 86, no. 1-3, pp. 47-57, 1990.
[CrossRef] [Google Scholar] [Publisher Link]
[4] Wayne Goddard, Michael A. Henning, and Charles A. McPillan, “Semitotal Domination in Graphs,” Utilitas Mathematica, vol. 94, pp. 67-81, 2014.
[Google Scholar] [Publisher Link]
[5] Teresa W. Haynes, Stephen T. Hedetniemi, and Peter J. Slater, Domination in Graphs: Advanced Topics, Marcel Dekker, New York, pp. 1-520, 1998.
[Google Scholar] [Publisher Link]
[6] Teresa W. Haynes, Stephen Hedetniemi, and Peter Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, pp. 1-464, 1998.
[Google Scholar] [Publisher Link]
[7] Zeliha Kartal Yıldız, and Aysun Aytaç, “Semitotal Bondage Number of Certain Graphs,” III.Uluslararasi Avrasya Multidisipliner Calismalar Kongresi, pp. 659-664, 2019.
[Google Scholar] [Publisher Link]
[8] Zeliha Kartal Yıldız, “A Note on the Semitotal Domination Number and Semitotal Bondage Number of Wheel and Cycle Related Graphs,” Journal of Modern Technology and Engineering, vol. 6, no. 3, pp. 230-241, 2021.
[Google Scholar] [Publisher Link]
[9] V.R. Kulli, and D.K. Patwari, “The Total Bondage Number of a Graph,” Advances in Graph Theory, pp. 227-235, 1991.
[Google Scholar]
[10] V.R. Kulli, and N.D. Soner, “Efficient Bondage Number of a Graph,” National Academy Science Letters, vol. 19, no. 9, pp. 1-6, 1996.
[Google Scholar]
[11] S.V. Padmavathi and J. Sabari Manju, “Independent Semitotal Domination in Graphs”, (To appear)
[12] I. Sahul Hamid, and S. Balamurugan, “Isolate Domination in Graphs,” Arab Journal of Mathematical Sciences, vol. 22, no. 2, pp. 232-241, 2016.
[CrossRef] [Google Scholar] [Publisher Link]
[13] N. Sridharan, M.D. Elias, and V.S.A. Subramanian, “Total Bondage Number of a Graph,” AKCE International Journal of Graphs and Combinatorics, vol. 4, no. 2, pp. 203-209, 2007.
[CrossRef] [Google Scholar] [Publisher Link]
[14] Ulrich Teschner, “New Results about the Bondage Number of a Graph,” Discrete Mathematics, vol. 171, no. 1-3, pp. 249-259, 1997.
[CrossRef] [Google Scholar] [Publisher Link]