The total irredundance numbers on graphs
From MaRDI portal
Publication:3610428
Recommendations
Cites work
- A note on the irredundance number after vertex deletion
- Changing upper irredundance by edge addition
- Chordal graphs and upper irredundance, upper domination and independence
- scientific article; zbMATH DE number 4055676 (Why is no real title available?)
- scientific article; zbMATH DE number 866675 (Why is no real title available?)
- Independence and upper irredundance in claw-free graphs
- Irredundance and Maximum Degree in Graphs
- On the differences between the upper irredundance, upper domination and independence numbers of a graph
- Stability, domination and irredundance in a graph
- The sequence of upper and lower domination, independence and irredundance numbers of a graph
- Total irredundance in graphs
- Unique irredundance, domination and independent domination in graphs
Cited in
(5)
This page was built for publication: The total irredundance numbers on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3610428)