Inequalities between the \(K_k\)-isolation number and the independent \(K_k\)-isolation number of a graph

DOI10.1016/J.DAM.2020.09.011zbMath1454.05084OpenAlexW3093070957MaRDI QIDQ2217464

Pawaton Kaemawichanurat, Odile Favaron

Publication date: 29 December 2020

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

Full work available at URL: https://doi.org/10.1016/j.dam.2020.09.011

zbMATH Keywords

partial domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (7)

Isolation of the diamond graph ⋮ Isolation of connected graphs ⋮ A sharp upper bound on the cycle isolation number of graphs ⋮ Cycle isolation of graphs with small girth ⋮ A note on the cycle isolation number of graphs ⋮ Extensions of the Art Gallery Theorem ⋮ Unnamed Item

Cites Work

• On the ratio of the domination number and the independent domination number in graphs
• A note on the independent domination number in graphs
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Partial domination - the isolation number of a graph
• Unnamed Item

This page was built for publication: Inequalities between the \(K_k\)-isolation number and the independent \(K_k\)-isolation number of a graph