A lower bound for the CO-irredundance number of a graph
From MaRDI portal
Publication:556836
DOI10.1016/j.disc.2004.12.009zbMath1075.05067MaRDI QIDQ556836
Publication date: 23 June 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.12.009
05C35: Extremal problems in graph theory
05C55: Generalized Ramsey theory
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Cites Work
- Irredundancy in circular arc graphs
- The irredundance number and maximum degree of a graph
- Open irredundance and maximum degree in graphs
- Nordhaus-Gaddum results for CO-irredundance in graphs
- Properties of Hereditary Hypergraphs and Middle Graphs
- The Private Neighbor Cube
- Irredundance and Maximum Degree in Graphs
- Ramsey properties of generalised irredundant sets in graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item