On the differences between the upper irredundance, upper domination and independence numbers of a graph

DOI10.1016/S0012-365X(99)00008-4zbMath0932.05071MaRDI QIDQ1301668

Dieter Rautenbach

Publication date: 12 September 1999

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

independencedominationirredundance number

Mathematics Subject Classification ID

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

Related Items (2)

The total irredundance numbers on graphs ⋮ Irredundance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• What is the difference between the domination and independent domination numbers of a cubic graph?
• Contributions to the theory of domination, independence and irredundance in graphs
• Chordal graphs and upper irredundance, upper domination and independence
• Disproof of a conjecture in the domination theory
• Inequalities relating domination parameters in cubic graphs
• Properties of Hereditary Hypergraphs and Middle Graphs

This page was built for publication: On the differences between the upper irredundance, upper domination and independence numbers of a graph