A lower bound for the CO-irredundance number of a graph

DOI10.1016/j.disc.2004.12.009zbMath1075.05067OpenAlexW1993704342MaRDI QIDQ556836

Stephen Finbow

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Irredundance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• CO-irredundant Ramsey numbers for graphs
• Ramsey properties of generalised irredundant sets in graphs

This page was built for publication: A lower bound for the CO-irredundance number of a graph