betaFeedback

WorksMathematics

Distance-22 isolation of connected graphs

Abstract

If F\mathcal{F} is a set of graphs and FF is a copy of a graph in F\mathcal{F}, then we call FF an F\mathcal{F}-graph. Let GG be a connected nn-vertex graph. For a subset DD of the vertex set V(G)V(G), let N2[D]N^2[D] denote the second closed neighbourhood of DD. Let ι2(G,F)ι_2(G, \mathcal{F}) denote the size of a smallest subset DD of V(G)V(G) such that N2[D]N^2[D] intersects the F\mathcal{F}-graphs contained by GG (equivalently, G−N2[G]G - N^2[G] contains no F\mathcal{F}-graph). For k≥0k \geq 0, let Ek\mathcal{E}_k denote the set of connected graphs that have at least kk edges (and at least one vertex if k=0k = 0). By a well-known result of Meir and Moon, ι2(G,E0)≤n/3ι_2(G, \mathcal{E}_0) \leq n/3 if n≥3n \geq 3. We show that ι2(G,E1)≤n/4ι_2(G, \mathcal{E}_1) \leq n/4 if n≠2n \neq 2, n≠3n \neq 3 and GG is not a 77-cycle. Hua and Liu recently showed that if GG is not a 44-vertex path or a 44-cycle or a 99-cycle, then there exists a subset DD of V(G)V(G) such that ∣D∣≤n/5|D| \leq n/5 and each component of G−N2[D]G-N^2[D] has a universal vertex. We strengthen this result by showing that ι2(G,E2)≤n/5ι_2(G, \mathcal{E}_2) \leq n/5 if n≠3n \neq 3, n≠4n \neq 4 and GG is not an 88-cycle or one of five 99-vertex graphs. It follows that ι2(G,E3)≤n/5ι_2(G, \mathcal{E}_3) \leq n/5 if GG is not a 33-cycle or a 44-vertex graph or a 99-cycle. This also implies the result of Hua and Liu, and that if C\mathcal{C} is the set of cycles, then ι2(G,C)≤n/5ι_2(G, \mathcal{C}) \leq n/5 unless GG is a 33-cycle or a 44-vertex graph containing a cycle. All these bounds are sharp.

Paper details

vlnc:W_ze52sjx7
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…