The irredundance number and maximum degree of a graph
From MaRDI portal
Publication:793760
DOI10.1016/0012-365X(84)90118-3zbMATH Open0539.05056MaRDI QIDQ793760FDOQ793760
Authors: Béla Bollobás, E. J. Cockayne 
Publication date: 1984
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- Irredundance and Maximum Degree in Graphs
- Open irredundance and maximum degree in graphs
- The total irredundance numbers on graphs
- Irredundance saturation number of a graph
- Total irredundance in graphs
- Inequalities involving the irredundance number of a graph
- Independence, irredundance, degrees and chromatic number in graphs
- The maximal degree of a zero-divisor graph
- The maximum size of graphs satisfying a degree condition
- The maximum degree of a random graph
Cites Work
Cited In (17)
- Irreducible graphs
- A lower bound for the CO-irredundance number of a graph
- Irredundancy in circular arc graphs
- Inequalities involving the irredundance number of a graph
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Open irredundance and maximum degree in graphs
- Irredundance perfect graphs
- Enumeration and maximum number of maximal irredundant sets for chordal graphs
- The total irredundance numbers on graphs
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
- On the total irredundance number of non-regular graphs
- Changing upper irredundance by edge addition
- Coalescence and criticality of graphs
- Irredundance
- A note on the irredundance number after vertex deletion
- Title not available (Why is that?)
- The complexity of irredundant sets parameterized by size
This page was built for publication: The irredundance number and maximum degree of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q793760)
