Proof of a conjecture on isolation of graphs dominated by a vertex
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911111775780864 |
|---|---|
| author | Borg, Peter |
| author_facet | Borg, Peter |
| contents | A copy of a graph $F$ is called an $F$-copy. For any graph $G$, the $F$-isolation number of $G$, denoted by $ι(G,F)$, is the size of a smallest subset $D$ of the vertex set of $G$ such that the closed neighbourhood $N[D]$ of $D$ in $G$ intersects the vertex sets of the $F$-copies contained by $G$ (equivalently, $G-N[D]$ contains no $F$-copy). Thus, $ι(G,K_1)$ is the domination number $γ(G)$ of $G$, and $ι(G,K_2)$ is the vertex-edge domination number of $G$. We prove that if $F$ is a $k$-edge graph, $γ(F) = 1$ (that is, $F$ has a vertex that is adjacent to all the other vertices of $F$), and $G$ is a connected $m$-edge graph, then $ι(G,F) \leq \big\lfloor \frac{m+1}{k+2} \big\rfloor$ unless $G$ is an $F$-copy or $F$ is a $3$-path and $G$ is a $6$-cycle. This was recently posed as a conjecture by Zhang and Wu, who settled the extreme case where $F$ is a star. The result for the other extreme case where $F$ is a clique had been obtained by Fenech, Kaemawichanurat and the present author. The bound is attainable for any $m \geq 0$ unless $1 \leq m = k \leq 2$. New ideas, including deletion methods and divisibility considerations, are introduced in the proof of the conjecture. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_18126 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Proof of a conjecture on isolation of graphs dominated by a vertex Borg, Peter Combinatorics Discrete Mathematics 05C35, 05C69 A copy of a graph $F$ is called an $F$-copy. For any graph $G$, the $F$-isolation number of $G$, denoted by $ι(G,F)$, is the size of a smallest subset $D$ of the vertex set of $G$ such that the closed neighbourhood $N[D]$ of $D$ in $G$ intersects the vertex sets of the $F$-copies contained by $G$ (equivalently, $G-N[D]$ contains no $F$-copy). Thus, $ι(G,K_1)$ is the domination number $γ(G)$ of $G$, and $ι(G,K_2)$ is the vertex-edge domination number of $G$. We prove that if $F$ is a $k$-edge graph, $γ(F) = 1$ (that is, $F$ has a vertex that is adjacent to all the other vertices of $F$), and $G$ is a connected $m$-edge graph, then $ι(G,F) \leq \big\lfloor \frac{m+1}{k+2} \big\rfloor$ unless $G$ is an $F$-copy or $F$ is a $3$-path and $G$ is a $6$-cycle. This was recently posed as a conjecture by Zhang and Wu, who settled the extreme case where $F$ is a star. The result for the other extreme case where $F$ is a clique had been obtained by Fenech, Kaemawichanurat and the present author. The bound is attainable for any $m \geq 0$ unless $1 \leq m = k \leq 2$. New ideas, including deletion methods and divisibility considerations, are introduced in the proof of the conjecture. |
| title | Proof of a conjecture on isolation of graphs dominated by a vertex |
| topic | Combinatorics Discrete Mathematics 05C35, 05C69 |
| url | https://arxiv.org/abs/2407.18126 |