Isolation of \(k\)-cliques
From MaRDI portal
Publication:2182198
DOI10.1016/j.disc.2020.111879zbMath1440.05157arXiv1812.11098OpenAlexW3010685994MaRDI QIDQ2182198
Kurt Fenech, Pawaton Kaemawichanurat, Peter Borg
Publication date: 21 May 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.11098
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
- Unnamed Item
- Distance domination, guarding and covering of maximal outerplanar graphs
- Distance \(k\)-domination, distance \(k\)-guarding, and distance \(k\)-vertex cover of maximal outerplanar graphs
- \(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 \(k\)-cliques