Irredundance and Maximum Degree in Graphs
From MaRDI portal
Publication:4348784
DOI10.1017/S0963548396002891zbMATH Open0881.05068OpenAlexW2052574623MaRDI QIDQ4348784FDOQ4348784
E. J. Cockayne, Christina M. Mynhardt
Publication date: 7 August 1997
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548396002891
Recommendations
Cited In (22)
- A lower bound for the CO-irredundance number of a graph
- Inequalities involving the irredundance number of a graph
- The irredundance number and maximum degree of a graph
- Title not available (Why is that?)
- Open irredundance and maximum degree in graphs
- An alternative definition of the \(k\)-irredundance
- Enumeration and maximum number of maximal irredundant sets for chordal graphs
- The total irredundance numbers on graphs
- Partial domination and irredundance numbers in graphs
- Irredundance in inflated graphs
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
- On the total irredundance number of non-regular graphs
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability
- Maximal irredundant functions
- Title not available (Why is that?)
- Irredundance, secure domination and maximum degree in trees
- On the Complexity Landscape of the Domination Chain
- Stability, domination and irredundance in a graph
- Irredundance
- A note on the irredundance number after vertex deletion
- Title not available (Why is that?)
- Irredundance in grids
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)
