Changing upper irredundance by edge addition

DOI10.1016/S0012-365X(02)00806-3zbMath1023.05106MaRDI QIDQ1810642

E. J. Cockayne, P. J. P. Grobler, Odile Favaron, Wayne Goddard, Christina M. Mynhardt

Publication date: 9 June 2003

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

zbMATH Keywords

dominationupper irredundance numberupper irredundance critical graph

Mathematics Subject Classification ID

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

Related Items (3)

Enumeration and maximum number of maximal irredundant sets for chordal graphs ⋮ The total irredundance numbers on graphs ⋮ Irredundance

Cites Work

• Vertex criticality for upper domination and irredundance
• Irredundant ramsey numbers for graphs
• Domination parameters and edge-removal-critical graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Changing upper irredundance by edge addition