Forcing Subsets of Connected Co-Independent Hop Domination in the Edge Corona and Lexicographic Product of Graphs
-
Published:2022-10-31
Issue:4
Volume:15
Page:1597-1612
-
ISSN:1307-5543
-
Container-title:European Journal of Pure and Applied Mathematics
-
language:
-
Short-container-title:Eur. J. Pure Appl. Math.
Author:
Calanza Yves Dave,Rara Helen
Abstract
This study deals with the forcing subsets of a minimum connected co-independent hop dominating sets in graphs. Bounds or exact values of the forcing connected co-independent hop domination numbers of graphs resulting from some binary operations such asedge corona and lexicographic product of graphs are determined.Some main results generated in this study include: (a) characterization of the minimum connected co-independent hop dominating sets; and (b) characterization of the forcing subsets for these types of sets.
Funder
Department of Science and Technology, Republic of the Philippines
Publisher
New York Business Global LLC
Subject
Applied Mathematics,Geometry and Topology,Numerical Analysis,Statistics and Probability,Algebra and Number Theory,Theoretical Computer Science