Irredundance and Maximum Degree in Graphs
From MaRDI portal
Publication:4348784
Recommendations
Cited in
(25)- Irredundance saturation number of a graph
- scientific article; zbMATH DE number 7759278 (Why is no real title available?)
- On the total irredundance number of non-regular graphs
- Maximal irredundant functions
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
- Irredundance in grids
- A lower bound for the CO-irredundance number of a graph
- Extremal problems related to the cardinality-redundance of graphs
- On the trees with maximum cardinality-redundance number
- Open irredundance and maximum degree in graphs
- Enumeration and maximum number of maximal irredundant sets for chordal graphs
- The total irredundance numbers on graphs
- An alternative definition of the \(k\)-irredundance
- scientific article; zbMATH DE number 3977049 (Why is no real title available?)
- scientific article; zbMATH DE number 1792610 (Why is no real title available?)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability
- Stability, domination and irredundance in a graph
- On the complexity landscape of the domination chain
- A note on the irredundance number after vertex deletion
- Inequalities involving the irredundance number of a graph
- Irredundance, secure domination and maximum degree in trees
- Irredundance
- Partial domination and irredundance numbers in graphs
- The irredundance number and maximum degree of a graph
- Irredundance in inflated graphs
This page was built for publication: Irredundance and Maximum Degree in Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4348784)
