The ratio of the distance irredundance and domination numbers of a graph

DOI10.1002/JGT.3190180102MaRDI QIDQ4277983zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

treedistancebound\(n\)-domination number\(n\)-irredundance number

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Recommendations

• scientific article; zbMATH DE number 861435
• Irredundance number versus domination number
• The rati of the irredundance and domination number of a graph
• scientific article; zbMATH DE number 798658
• Distance domination and distance irredundance in graphs

Cites work

• scientific article; zbMATH DE number 146666 (Why is no real title available?)
• scientific article; zbMATH DE number 3627237 (Why is no real title available?)
• scientific article; zbMATH DE number 617203 (Why is no real title available?)
• scientific article; zbMATH DE number 1934392 (Why is no real title available?)
• scientific article; zbMATH DE number 798658 (Why is no real title available?)
• scientific article; zbMATH DE number 861435 (Why is no real title available?)
• A characterization of graphs without long induced paths
• A note on distance-dominating cycles
• A sufficient condition for dominating cycles
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Irredundance number versus domination number
• On packing and covering numbers of graphs
• Relations between packing and covering numbers of a tree
• The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
• The diversity of domination

Cited in

(9)

• On connected k-domination numbers of graphs.
• Distance irredundance in graphs: Complexity issues
• Distance irredundance and connected domination numbers of a graph
• Irredundance perfect graphs
• scientific article; zbMATH DE number 844146 (Why is no real title available?)
• 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)