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

DOI10.1016/J.DISC.2004.12.009MaRDI QIDQ556836zbMATH OpenOpenAlexFDO

Authors 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) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Generalized Ramsey theory (05C55)

Recommendations

• Nordhaus-Gaddum results for CO-irredundance in graphs
• OC-irredundance, CO-irredundance and maximum degree in trees
• CO-irredundant Ramsey numbers for graphs
• Irredundance and Maximum Degree in Graphs
• Total irredundance in graphs

Cites work

• scientific article; zbMATH DE number 3859049 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1501970 (Why is no real title available?)
• scientific article; zbMATH DE number 1416461 (Why is no real title available?)
• CO-irredundant Ramsey numbers for graphs
• Irredundance and Maximum Degree in Graphs
• Irredundancy in circular arc graphs
• Nordhaus-Gaddum results for CO-irredundance in graphs
• Open irredundance and maximum degree in graphs
• Properties of Hereditary Hypergraphs and Middle Graphs
• Ramsey properties of generalised irredundant sets in graphs
• The Private Neighbor Cube
• The irredundance number and maximum degree of a graph

Cited in

(3)

• OC-irredundance, CO-irredundance and maximum degree in trees
• Nordhaus-Gaddum results for CO-irredundance in graphs
• Irredundance

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q556836)