Isolation of \(k\)-cliques. II

DOI10.1016/j.disc.2021.112641zbMath1489.05109OpenAlexW3203801088MaRDI QIDQ2138948

Peter Borg, Pawaton Kaemawichanurat, Kurt Fenech

Publication date: 17 May 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2021.112641

zbMATH Keywords

cliquedominating setclosed neighbourhoodisolating set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

Isolation of connected graphs ⋮ A sharp upper bound on the cycle isolation number of graphs ⋮ Partial domination and irredundance numbers in 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 ⋮ Admissible property of graphs in terms of independence number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Introduction to ``Topics on Domination
• Bibliography on domination in graphs and some basic definitions of domination parameters
• On graphs having domination number half their order
• Isolation of cycles
• Isolation of \(k\)-cliques
• Domination-balanced graphs
• Towards a theory of domination in graphs
• Partial domination - the isolation number of a graph

This page was built for publication: Isolation of \(k\)-cliques. II