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

DOI10.1016/J.DISC.2004.12.009zbMATH Open1075.05067OpenAlexW1993704342MaRDI QIDQ556836FDOQ556836

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

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

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)

Cites Work

• Title not available (Why is that?)
• Properties of Hereditary Hypergraphs and Middle Graphs
• Title not available (Why is that?)
• Nordhaus-Gaddum results for CO-irredundance in graphs
• The Private Neighbor Cube
• Irredundance and Maximum Degree in Graphs
• Title not available (Why is that?)
• CO-irredundant Ramsey numbers for graphs
• Title not available (Why is that?)
• Ramsey properties of generalised irredundant sets in graphs
• Irredundancy in circular arc graphs
• The irredundance number and maximum degree of a graph
• Open irredundance and maximum degree in graphs

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)