Revisiting the outer-weakly convex domination number in graph products

TL;DR

This paper investigates the outer-weakly convex domination number in graphs, providing exact values for various graph products and exploring related combinatorial properties.

Contribution

It introduces the concept of outer-weakly convex domination number and determines its values for Cartesian, strong, and lexicographic graph products.

Findings

Calculated the outer-weakly convex domination number for specific graph products.

Established bounds and exact values for this parameter in various graph classes.

Discussed combinatorial implications of the outer-weakly convex domination number.

Abstract

Let $G = (V, E)$ be a simple undirected connected graph. A set $C \subseteq V(G)$ is weakly convex in $G$ if for every two vertices $u,v$ in $G$, there exists a $u-v$ geodesic whose vertices are in $C$. A set $C \subseteq V$ is an outer-weakly convex dominating set if every vertex not in $C$ is adjacent to some vertex in $C$ and the set $V(G)\setminus C$ is weakly convex in $G$. The outer-weakly convex domination number of graph $G$, denoted by $\widetilde{ \gamma}_{wcon}(G)$, is the minimum cardinality of an outer-weakly convex dominating set of graph $G$. In this paper, we determine the outer-weakly convex domination number of two graphs under the Cartesian, strong and lexicographic products, and discuss some important combinatorial findings.