INDEPENDENT SEMITOTAL DOMINATION IN THE CORONA OF GRAPHS
Given a connected noncomplete graph G with order at least 3, a subset is an independent semitotal dominating set of G, abbreviated ISTd-set of G, if W independently dominates G and every element of W is exactly at distance 2 from another element of W. The minimum cardinality of such an ISTd-set of G is denoted by and is called a -set of G. In this study, we characterize the ISTd-sets of the vertex corona and edge corona of two connected graphs G and H, each of which has order at least 3. Finally, we generate specific formulas for the numbers and
independent semitotal domination, vertex corona of graphs, edge corona of graphs.
Received: March 3, 2023; Revised: April 6, 2023; Accepted: April 20, 2023; Published: May 13, 2023
How to cite this article: Bryan L. Susada and Rolito G. Eballe, Independent semitotal domination in the corona of graphs, Advances and Applications in Discrete Mathematics 39(1) (2023), 89-98. http://dx.doi.org/10.17654/0974165823038
This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License
References:
[1] W. Goddard, M. Henning and C. McPillan, Semitotal domination in graphs, Util. Math. 94 (2014), 67-81.[2] 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.[3] 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.[4] A. T. Miranda and R. G. Eballe, Domination defect for the join and corona of graphs, Appl. Math. Sci. 15(12) (2021), 615-623.[5] Damalerio, M. Remarl Joseph, Rolito G. Eballe, Cherry Mae R. Balingit, Isagani S. Cabahug, Jr. and Ann Leslie V. Flores, Global clustering coefficient of the join and corona of graphs, Asian Research Journal of Mathematics 18(12) (2022), 128-140.[6] 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 Combin. 107 (2012), 225-245.[7] Mae P. Militante and R. G. Eballe, Exploring the vertex and edge corona of graphs for their weakly connected 2-domination, International Journal of Contemporary Mathematical Sciences 16(4) (2021), 161-172.[8] Aldwin T. Miranda and Rolito G. Eballe, Domination defect in the edge corona of graphs, Asian Research Journal of Mathematics 18(12) (2022), 95-101.[9] G. Chartrand, L. Lesniak and P. Zhang, Graphs and Digraphs (Discrete Mathematics and its Applications), 6th ed., Chapman and Hall/CRC, 2015.