Partial domination and irredundance numbers in graphs

DOI10.1016/j.amc.2023.128153arXiv2206.07208OpenAlexW4381094520MaRDI QIDQ6096253

Pawaton Kaemawichanurat, Odile Favaron

Publication date: 11 September 2023

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

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

zbMATH Keywords

irredundance number\(k\)-isolation number

Mathematics Subject Classification ID

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

Related Items (1)

A sharp upper bound on the cycle isolation number of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Irredundance number versus domination number
• The rati of the irredundance and domination number of a graph
• Total forcing versus total domination in cubic graphs
• Bounds on the paired domination number of graphs with minimum degree at least three
• Isolation of \(k\)-cliques. II
• Isolation of cycles
• Isolation of \(k\)-cliques
• Independent domination, colorings and the fractional idomatic number of a graph
• Partial domination of maximal outerplanar graphs
• A note on the independent domination number in graphs
• Graph-theoretic parameters concerning domination, independence, and irredundance
• The ratio of the irredundance number and the domination number for block-cactus graphs
• Irredundance and Maximum Degree in Graphs
• Paths, Stars and the Number Three
• Partial domination - the isolation number of a graph

This page was built for publication: Partial domination and irredundance numbers in graphs