Isolation of regular graphs, stars and -chromatic graphs
Abstract: Given a set of graphs, we call a copy of a graph in an -graph. The -isolation number of a graph , denoted by , is the size of a smallest set of vertices of such that the closed neighbourhood of intersects the vertex sets of the -graphs contained by (equivalently, contains no -graph). Thus, is the domination number of . For any integer , let , let be the set of regular graphs of degree at least , let be the set of graphs whose chromatic number is at least , and let be the union . We prove that if is a connected -vertex graph and , then unless is a -clique or and is a $5$-cycle. This generalizes a classical bound of Ore on the domination number, a bound of Caro and Hansberg on the -isolation number, a bound of the author on the cycle isolation number, and a bound of Fenech, Kaemawichanurat and the author on the -clique isolation number. By Brooks' Theorem, the same inequality holds if . The bounds are sharp.
Paper Prompts
Sign up for free to create and run prompts on this paper.