A note on graphs which have upper irredundance equal to independence

DOI10.1016/0166-218X(93)90224-CzbMath0784.05036MaRDI QIDQ686250

Kenneth Peters, Michael S. Jacobson

Publication date: 20 March 1994

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

zbMATH Keywords

independence numberirredundance numberupper domination number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (9)

Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance ⋮ Domination and irredundance in cubic graphs ⋮ Reconfiguring dominating sets in some well-covered and other classes of graphs ⋮ Using maximality and minimality conditions to construct inequality chains ⋮ Directed domination in oriented graphs ⋮ On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs ⋮ Irredundance ⋮ Upper domination and upper irredundance perfect graphs ⋮ Weighted irredundance of interval graphs.

Cites Work

• Irredundancy in circular arc graphs
• Contributions to the theory of domination, independence and irredundance in graphs
• Chordal graphs and upper irredundance, upper domination and independence
• Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
• Properties of Hereditary Hypergraphs and Middle Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on graphs which have upper irredundance equal to independence