Keywords and phrases: weakly connected domination, 2-domination, restrained weakly connected 2-domination.
Received: April 7, 2022; Accepted: May 19, 2022; Published: June 1, 2022
How to cite this article: Mae P. Militante and Rolito G. Eballe, Restrained weakly connected 2-domination in graphs, Advances and Applications in Discrete Mathematics 32 (2022), 13-24. http://dx.doi.org/10.17654/0974165822029
References: [1] G. Chartrand, L. Lesniak and P. Zhang, Graphs and Digraphs, 6th ed., CRC Press, New York, 2016. [2] G. S. Domke, J. H. Hattingh, S. T. Hedetniemi, R. C. Laskar and L. R. Markus, Restrained domination in graphs, Discrete Math. 203 (1999), 61-69. [3] J. E. Dunbar, J. W. Grossman, J. H. Hattingh, S. T. Hedetniemi and A. A. McRae, On weakly connected domination in graphs, Discrete Math. 167 (1997), 261-269. [4] J. F. Fink and M. S. Jacobson, On n-domination, n-dependence and forbidden subgraphs, Graph Theory with Application to Algorithms and Computer Science, John Wiley and Sons, New York, 1985, pp. 301-311. [5] I. P. Kelkar and J. J. Mohan, Restrained 2-domination in graphs, IOSR Journal of Engineering 2 (2012), 06-09. [6] V. R. Kulli, B. Janakiram and R. R. Iyer, The cototal domination number of a graph, J. Discrete Math. Sci. Cryptogr. 2 (1999), 179-184. [7] R. Leonida, Restrained weakly connected domination in the join and corona of graphs, Appl. Math. Sci. 9 (2015), 955-961. [8] M. Militante, Weakly connected 2-domination in graphs, Appl. Math. Sci. 15(11) (2021), 513-518. [9] M. Militante and R. Eballe, Weakly connected 2-domination in some special graphs, Appl. Math. Sci. 15(12) (2021), 579-586. [10] M. Militante and R. 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. [11] M. Militante, R. Eballe and R. Leonida, Weakly connected 2-domination in the join of graphs, Appl. Math. Sci. 15(12) (2021), 569-577.
|