Connected Co-Independent Hop Domination in the Edge Corona and Complementary Prism of Graphs

Authors

  • Sandra Nanding University of Southern Mindanao
  • Helen M. Rara
  • Imelda S. Aniversaro

DOI:

https://doi.org/10.29020/nybg.ejpam.v17i4.5342

Keywords:

hop dominating set, Strictly co-independent set,, edge corona

Abstract

Let G be a connected graph. A subset S of V(G) is a connected co-independent hop dominating set in G if the subgraph induced by S is connected and V(G)S is an independent set where for each vV(G)S, there exists a vertex uS such that dG(u,v)=2. The smallest cardinality of such an S is called the connected co-independent hop domination number of G. This paper presents the characterizations of the connected co-independent hop dominating sets in the edge corona and complementary prism of graphs and determines the exact values of their corresponding connected co-independent hop domination number.

Downloads

Published

2024-10-31

Issue

Section

Nonlinear Analysis

How to Cite

Connected Co-Independent Hop Domination in the Edge Corona and Complementary Prism of Graphs. (2024). European Journal of Pure and Applied Mathematics, 17(4), 2505-2515. https://doi.org/10.29020/nybg.ejpam.v17i4.5342