The ratio of the distance irredundance and domination numbers of a graph
From MaRDI portal
Publication:4277983
DOI10.1002/JGT.3190180102zbMATH Open0789.05047OpenAlexW2090036815MaRDI QIDQ4277983FDOQ4277983
Authors: Johannes H. Hattingh, Michael A. Henning 
Publication date: 26 January 1994
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190180102
Recommendations
Cites Work
- Graph-theoretic parameters concerning domination, independence, and irredundance
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- Relations between packing and covering numbers of a tree
- On packing and covering numbers of graphs
- Title not available (Why is that?)
- A characterization of graphs without long induced paths
- Irredundance number versus domination number
- Title not available (Why is that?)
- Title not available (Why is that?)
- A sufficient condition for dominating cycles
- A note on distance-dominating cycles
- The diversity of domination
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (9)
- On connected \(k\)-domination numbers of graphs.
- Distance irredundance in graphs: Complexity issues
- Irredundance perfect graphs
- Distance irredundance and connected domination numbers of a graph
- Title not available (Why is that?)
- An algorithm to find two distance domination parameters in a graph
- Using maximality and minimality conditions to construct inequality chains
- Irredundance number versus domination number
- The rati of the irredundance and domination number of a graph
This page was built for publication: The ratio of the distance irredundance and domination numbers of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4277983)
