Consider a connected noncomplete graph G with at least 3 vertices. If  is independent and dominates G such that every element of W is exactly of distance 2 from another element of W, then W is an independent semitotal dominating set of G, abbreviated ISTd-set of G. The parameter  represents the lowest cardinality of an ISTd-set of G. In this paper, we consider the composition  of G by H, where G is a connected noncomplete graph and H is any connected graph, and obtain its independent semitotal domination number.

independent semitotal domination, independent domination, lexicographic product of graphs.

Received: May 7, 2023; Revised: May 27, 2023; Accepted: June 10, 2023; Published: June 30, 2023

How to cite this article: Bryan L. Susada and Rolito G. Eballe, Independent semitotal domination in the lexicographic product of graphs, Advances and Applications in Discrete Mathematics 39(2) (2023), 237-244. http://dx.doi.org/10.17654/0974165823050

This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License

References
[1] R. G. Eballe, E. M. Llido and M. T. Nocete, Vertex independence in graphs under some binary operations, Matimyas Matematika 30(1) (2007), 37-40.
[2] G. Chartrand, L. Lesniak and P. Zhang, Graphs and Digraphs (Discrete Mathematics and its Applications) (6th ed.), Chapman and Hall/CRC, 2015.
[3] W. Goddard, M. Henning and C. McPillan, Semitotal domination in graphs, Utilitas Mathematica 94 (2014), 67-81.
[4] B. L. Susada and R. G. Eballe, Independent semitotal domination in the join of graphs, Asian Research Journal of Mathematics 19(3) (2023), 25-31.
[5] B. L. Susada and R. G. Eballe, Independent semitotal domination in the corona of graphs, Advances and Applications in Discrete Mathematics 39(1) (2023), 89-98.
[6] R. G. Eballe and S. R. Canoy, Jr., The essential cutset number and connectivity of the join and composition of graphs, Utilitas Mathematica 84 (2011), 257-264.
[7] R. G. Eballe, R. Aldema, E. M. Paluga, R. F. Rulete and F. P. Jamil, Global defensive alliances in the join, corona and composition of graphs, Ars Combinatoria 107 (2012), 225-245.
[8] S. R. Canoy Jr. and R. G. Eballe, M-convex hulls in graphs resulting from some binary operations, Applied Mathematical Sciences 8(88) (2014), 4389-4396.
[9] R. G. Eballe and S. R. Canoy Jr., Steiner sets in the join and composition of graphs, Congressus Numerantium 170 (2004), 65-73.
[10] M. P. Militant and R. G. Eballe, Weakly connected 2-domination in the lexicographic product of graphs, International Journal of Mathematical Analysis 16(3) (2022), 125-132.