Stability, domination and irredundance in a graph
From MaRDI portal
Publication:3752424
DOI10.1002/JGT.3190100402zbMATH Open0612.05056OpenAlexW2122837462MaRDI QIDQ3752424FDOQ3752424
Authors: Odile Favaron 
Publication date: 1986
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190100402
Recommendations
Cited In (23)
- 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
- On graphs with equal domination and independent domination numbers
- Title not available (Why is that?)
- Irredundancy in circular arc graphs
- On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs
- Domination and irredundance in cubic graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Claw-free graphs---a survey
- Irredundance perfect graphs
- Irredundant and perfect neighborhood sets in graphs and claw-free graphs
- Unique irredundance, domination and independent domination in graphs
- On the complexity landscape of the domination chain
- The total irredundance numbers on graphs
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
- Automated generation of conjectures on forbidden subgraph characterization
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability
- Construction of trees and graphs with equal domination parameters
- Irredundance
- Total domination stability in graphs
- On the ratios between packing and domination parameters of a graph
- Irredundance number versus domination number
- The sequence of upper and lower domination, independence and irredundance numbers of a 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)
