Isolation of cycles
From MaRDI portal
Publication:2175795
Abstract: For any graph , let denote the size of a smallest set of vertices of such that the graph obtained from by deleting the closed neighbourhood of contains no cycle. We prove that if is a connected -vertex graph that is not a triangle, then . We also show that the bound is sharp. Consequently, we solve a problem of Caro and Hansberg.
Recommendations
Cites work
- \(k\)-domination and \(k\)-independence in graphs: A survey
- A survey of selected recent results on total domination in graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- scientific article; zbMATH DE number 3596896 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- Independent domination in graphs: A survey and recent results
- Introduction to ``Topics on Domination
- Paired domination in graphs: a survey and recent results
- Partial domination -- the isolation number of a graph
- Total domination in graphs
- Towards a theory of domination in graphs
Cited in
(44)- Graphs in which \(G - N[v]\) is a cycle for each vertex \(v\)
- Admissible property of graphs in terms of radius
- Admissible property of graphs in terms of independence number
- Isolation of the diamond graph
- Isolation of \(k\)-cliques. II
- Graphs \(G\) in which \(G-N[v]\) has a prescribed property for each vertex \(v\)
- Isolation of \(k\)-cliques
- \( K_{1 , 2}\)-isolation in graphs
- Extensions of the Art Gallery Theorem
- \( P_5\)-isolation in graphs
- Isolation of connected graphs
- A sharp upper bound on the cycle isolation number of graphs
- Partial domination and irredundance numbers in graphs
- \(K_{1, 2}\)-isolation number of claw-free cubic graphs
- Cycle isolation of graphs with small girth
- A note on the cycle isolation number of graphs
- Graphs with isolation number equal to one third of the order
- Extremal graphs for the \(K_{1,2}\)-isolation number of graphs
- Graphs \(G\) where \(G-N[v]\) is a regular graph for each vertex \(v\)
- Graphs \(G\) where \(G-N[v]\) is a tree for each vertex \(v\)
- Isolation of regular graphs and \(k\)-chromatic graphs
- Algorithmic aspects of \(\{P_k\}\)-isolation in graphs and extremal graphs for a \(\{P_3\}\)-isolation bound
- \(k\)-isolation in graphs
- Isolation of squares in graphs
- On the cycle isolation number of triangle-free graphs
- Partial domination of hypergraphs
- A note on the \(P_3\)-isolation number of a graph
- Solution to a 3-path isolation problem for subcubic graphs
- Isolation of regular graphs, stars and k-chromatic graphs
- New results on the 1-isolation number of graphs without short cycles
- The probabilistic upper bounds on the isolation number of a graph
- On decycling and forest numbers of Cartesian products of trees
- Cycle isolation in graphs
- Total isolation of k-cliques in a graph
- Isolation of connected graphs in terms of size
- A characterization of graphs with maximum k-clique isolation number
- Proof of a conjecture on isolation of graphs dominated by a vertex
- On total isolation in graphs
- A characterization of graphs with maximum cycle isolation number
- Proof of a conjecture on isolation of cycles in graphs
- Upper bounds on the k-isolation number
- Solution to a problem on isolation of 3-vertex paths
- Isolation of non-triangle cycles in graphs
- Graphs with total isolation number equal to half the order
This page was built for publication: Isolation of cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175795)
