Isolation of connected graphs

DOI10.1016/j.dam.2023.05.004zbMath1528.05037arXiv2110.03773OpenAlexW3205165117MaRDI QIDQ6064845

Peter Borg

Publication date: 11 December 2023

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

Full work available at URL: https://arxiv.org/abs/2110.03773

zbMATH Keywords

dominationconnected graphisolationclosed neighbourhood

Mathematics Subject Classification ID

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

Related Items (1)

A sharp upper bound on the cycle isolation number of graphs

Cites Work

• 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
• Admissible property of graphs in terms of radius
• Isolation of the diamond graph
• Isolation of \(k\)-cliques. II
• Isolation of cycles
• Isolation of \(k\)-cliques
• Partial domination of maximal outerplanar graphs
• Inequalities between the \(K_k\)-isolation number and the independent \(K_k\)-isolation number of a graph
• \( K_{1 , 2}\)-isolation in graphs
• Isolation number of maximal outerplanar graphs
• Extensions of the Art Gallery Theorem
• Towards a theory of domination in graphs
• Partial domination - the isolation number of a graph

This page was built for publication: Isolation of connected graphs