Investigating Weakly Connected 2-Domination in the Complementary Prism of Graphs and in Some Unary Graph Operations

Mae P. Militante; Doli-Jane U. Tejada; Nadjua E. Seddic; Francis Nixon D. Demata; Emmanuel Campos

doi:10.26713/cma.v16i1.2837

Authors

Mae P. Militante Department of Mathematics, Mindanao State University – General Santos, General Santos City, Philippines https://orcid.org/0000-0002-5632-0340 (unauthenticated)
Doli-Jane U. Tejada Department of Mathematics, Mindanao State University – General Santos, General Santos City, Philippines https://orcid.org/0009-0008-9780-6786 (unauthenticated)
Nadjua E. Seddic Department of Mathematics, Mindanao State University – General Santos, General Santos City, Philippines https://orcid.org/0009-0005-9185-5972 (unauthenticated)
Francis Nixon D. Demata Department of Mathematics, Mindanao State University – General Santos, General Santos City, Philippines https://orcid.org/0009-0001-1508-9736 (unauthenticated)
Emmanuel Campos Department of Mathematics, Mindanao State University – General Santos, General Santos City, Philippines https://orcid.org/0009-0005-7755-1075 (unauthenticated)

DOI:

https://doi.org/10.26713/cma.v16i1.2837

Keywords:

Weakly connected 2-domination, Complementary prism, Edge deletion, Vertex deletion, Unary operations, Line graphs

Abstract

This paper dealt with the concepts of weakly connected 2-domination in the complementary prisms of graphs and graphs obtained by reducing their edges and vertices. In particular, bounds and exact values of the weakly connected 2-domination number in the complementary prism of graphs, graphs resulting from deleting an edge and vertex and line graphs are presented. In addition, properties of the graphs with weakly connected 2-domination number of complementary prism equal to 2 and 3, are provided.

538 227

Downloads

Download data is not yet available.

References

A. Alhashim, W. J. Desormeaux and T. W. Haynes, Roman domination in complementary prisms, Australian Journal of Combinatorics 68(2) (2017), 218 – 228, URL: https://ajc.maths.uq.edu.au/pdf/68/ajc_v68_p218.pdf.

G. Chartrand, L. Lesniak and P. Zhang, Graphs & Digraphs, 6th edition, CRC Press, New York, 640 pages (2015), DOI: 10.1201/b19731.

J. E. Dunbar, J. W. Grossman, J. H. Hattingh, S. T. Hedetniemi and A. A. McRae, On weakly connected domination in graphs, Discrete Mathematics 167-168 (1997), 261 – 269, DOI: 10.1016/S0012-365X(96)00233-6.

J. F. Fink and M. S. Jacobson, On n-domination, n-dependence and forbidden subgraphs, in: Graph Theory with Applications to Algorithms and Computer Science, Y. Alavi, G. Chartrand, D. R. Lick, C. E. Wall and L. Lesniak (editors), John Wiley & Sons, Inc., New York, pp. 301 – 311 (1985), DOI: 10.5555/21936.25447.

M. Lemanska, Domination numbers in graphs with removed edge or set of edges, Discussiones Mathematicae Graph Theory 25(1-2) (2005), 51 – 56, DOI: 10.7151/dmgt.1259.

M. P. Militante and R. G. Eballe, Weakly connected 2-domination in some special graphs, Applied Mathematical Sciences 15(12) (2021), 579 – 586, DOI: 10.12988/ams.2021.914590.

M. 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, DOI: 10.12988/ijcms.2021.91633.

S. Otávio and M. R. Cappelle, k-Independence on complementary prism graphs, Matemática Contemporânea 48 (2021), 211 – 220, DOI: 10.21711/231766362021/rmc4821.