# Vizing-type bounds for graphs with induced subgraph restrictions

## TL;DR

This paper establishes new Vizing-type bounds for the domination number of Cartesian products of graphs with specific induced subgraph restrictions, expanding understanding of how structural properties influence these bounds.

## Contribution

The paper introduces several new Vizing-type bounds for graphs with forbidden induced subgraphs, relating domination numbers of graph products to structural graph properties.

## Key findings

- For triangle and $K_{1,r}$-free graphs, derived specific bounds involving $r$.
- For $K_r$ and $P_5$-free graphs, established bounds depending on $r$.
- Identified conditions under which the domination number of the product equals the product of individual domination numbers.

## Abstract

For any graphs $G$ and $H$, we say that a bound is of Vizing-type if $\gamma(G\square H)\geq c \gamma(G)\gamma(H)$ for some constant $c$. We show several bounds of Vizing-type for graphs $G$ with forbidden induced subgraphs. In particular, if $G$ is a triangle and $K_{1,r}$-free graph, then for any graph $H$, $\gamma(G\square H)\geq \frac{r}{2r-1}\gamma(G)\gamma(H)$. If $G$ is a $K_r$ and $P_5$-free graph for some integer $r\geq 2$, then for any graph $H$, $\gamma(G\square H)\geq \frac{r-1}{2r-3}\gamma(G)\gamma(H)$. We do this by bounding the power of $G$, $\pi(G)$. We show that if $G$ is claw-free and $P_6$-free or $K_4$ and $P_5$-free, then for any graph $H$, $\gamma(G\square H)\geq \gamma(G)\gamma(H)$. Furthermore, we show Vizing-type bounds in terms of the diameter of $G$.