Stability, domination and irredundance in a graph
From MaRDI portal
(Redirected from Publication:3752424)
Recommendations
Cited in
(23)- On the ratios between packing and domination parameters of a graph
- Irredundance number versus domination number
- On graphs with equal domination and independent domination numbers
- Irredundant and perfect neighborhood sets in graphs and claw-free graphs
- The sequence of upper and lower domination, independence and irredundance numbers of a graph
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
- Domination and irredundance in cubic graphs
- Claw-free graphs---a survey
- On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs
- Total domination stability in graphs
- Irredundance perfect graphs
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability
- Construction of trees and graphs with equal domination parameters
- Unique irredundance, domination and independent domination in graphs
- On the complexity landscape of the domination chain
- Irredundance
- The total irredundance numbers on graphs
- scientific article; zbMATH DE number 1507962 (Why is no real title available?)
- Irredundancy in circular arc graphs
- Automated generation of conjectures on forbidden subgraph characterization
- Bibliography on domination in graphs and some basic definitions of domination parameters
- An upper bound on the radius of a 3-edge-connected \(C_4\)-free graph
- An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph
This page was built for publication: Stability, domination and irredundance in a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3752424)
