Papers
Topics
Authors
Recent
Search
2000 character limit reached

Isolation of regular graphs, stars and kk-chromatic graphs

Published 23 Mar 2023 in math.CO and cs.DM | (2303.13709v3)

Abstract: Given a set F\mathcal{F} of graphs, we call a copy of a graph in F\mathcal{F} an F\mathcal{F}-graph. The F\mathcal{F}-isolation number of a graph GG, denoted by ι(G,F)\iota(G,\mathcal{F}), is the size of a smallest set DD of vertices of GG such that the closed neighbourhood of DD intersects the vertex sets of the F\mathcal{F}-graphs contained by GG (equivalently, G−N[D]G - N[D] contains no F\mathcal{F}-graph). Thus, ι(G,{K1})\iota(G,\{K_1\}) is the domination number of GG. For any integer k≥1k \geq 1, let F0,k={K1,k}\mathcal{F}_{0,k} = \{K_{1,k}\}, let F1,k\mathcal{F}_{1,k} be the set of regular graphs of degree at least k−1k-1, let F2,k\mathcal{F}_{2,k} be the set of graphs whose chromatic number is at least kk, and let F3,k\mathcal{F}_{3,k} be the union F0,k∪F1,k∪F2,k\mathcal{F}_{0,k} \cup \mathcal{F}_{1,k} \cup \mathcal{F}_{2,k}. We prove that if GG is a connected nn-vertex graph and F=F0,k∪F1,k\mathcal{F} = \mathcal{F}_{0,k} \cup \mathcal{F}_{1,k}, then ι(G,F)≤nk+1\iota(G, \mathcal{F}) \leq \frac{n}{k+1} unless GG is a kk-clique or k=2k = 2 and GG is a $5$-cycle. This generalizes a classical bound of Ore on the domination number, a bound of Caro and Hansberg on the {K1,k}\{K_{1,k}\}-isolation number, a bound of the author on the cycle isolation number, and a bound of Fenech, Kaemawichanurat and the author on the kk-clique isolation number. By Brooks' Theorem, the same inequality holds if F=F3,k\mathcal{F} = \mathcal{F}_{3,k}. The bounds are sharp.

Authors (1)
Citations (13)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.