We defined the weakly connected dominant sets in the K rgluing of full graphs and corona of graphs in this study. The weakly connected domination number of the aforementioned graphs was obtained using con sequences. In the join of graphs, the weakly connected domination number is also determined.
Author (S) Details
Prof. Elsie P. Sandueta
Jose Rizal Memorial State University Dipolog Campus, Dipolog City, Philippines.
Prof. Sergio R. Canoy Jr.
Department of Mathematics College of Science and Mathematics MSU-IIT, Iligan City, Philippines.
View Book :- https://stm.bookpi.org/CTMCS-V7/article/view/2943
No comments:
Post a Comment