1-MOVABLE DOUBLE OUTER-INDEPENDENT DOMINATION IN GRAPHS
A nonempty set is a 1-movable double outer-independent dominating set of G if S is a double outer-independent dominating set of G and for every is a double outer-independent dominating set of G or there exists a vertex such that is a double outer-independent dominating set of G. The 1-movable double outer-independent domination number of a graph G, denoted by is the smallest cardinality of a 1-movable double outer-independent dominating set of G. A 1-movable double outer-independent dominating set of G with cardinality equal to is called -set of G. This paper characterizes 1-movable double outer-independent dominating sets in the join and corona of two graphs.
double outer-independent domination, 1-movable domination, 1-movable double outer-independent domination.
Received: April 30, 2023; Accepted: July 1, 2023; Published: July 22, 2024
How to cite this article: Marry Ann E. Anore, Jocecar L. Hinampas and Renario G. Hinampas Jr., 1-movable double outer-independent domination in graphs, Advances and Applications in Discrete Mathematics 40(1) (2023), 43-55. http://dx.doi.org/10.17654/0974165823056
This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License
References:[1] J. Blair, R. Gera and S. Horton, Movable dominating sensor sets in networks, J. Combin. Math. Combin. Comput. 77 (2011), 103-123.[2] W. Goddard and M. Henning, Independent domination in graphs: a survey and recent results, Discrete Math. 268(1) (2013), 299-302.[3] F. Harary and T. Haynes, Double domination in graphs, Ars Combin. 55 (2000), 201-213.[4] R. Hinampas and S. R. Canoy, Jr., 1-movable domination in graphs, Appl. Math. Sci. 8(172) (2014), 8565-8571.[5] M. Krzywkowski, Total outer-independent domination in graphs, 2014.http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.704.9143&rep=rep1&type=pdf.
