Isolation of cycles
From MaRDI portal
Publication:2175795
DOI10.1007/s00373-020-02143-2zbMath1439.05117arXiv1812.09305OpenAlexW3012476946MaRDI QIDQ2175795
Publication date: 30 April 2020
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.09305
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Related Items (16)
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\)] ⋮ \( 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 ⋮ Extensions of the Art Gallery Theorem ⋮ \( K_{1 , 2}\)-isolation in graphs ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Introduction to ``Topics on Domination
- Bibliography on domination in graphs and some basic definitions of domination parameters
- A survey of selected recent results on total domination in graphs
- Independent domination in graphs: A survey and recent results
- Towards a theory of domination in graphs
- Total Domination in Graphs
- Partial domination - the isolation number of a graph
This page was built for publication: Isolation of cycles