Inequalities involving the irredundance number of a graph

DOI10.1016/j.disc.2005.06.023zbMath1077.05079OpenAlexW2026624299MaRDI QIDQ2576844

Sam E. Speed

Publication date: 29 December 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.06.023

zbMATH Keywords

upper boundWelsh-Powell number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Two relations between the parameters of independence and irredundance
• Partition graphs and coloring numbers of a graph
• Gallai-type theorems and domination parameters
• Achromatic number versus pseudoachromatic number: A counterexample to a conjecture of Hedetniemi
• Graph colorings with local constraints -- a survey
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• An inequality for the chromatic number of a graph
• Bounds for the chromatic number of a graph
• 25 pretty graph colouring problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Inequalities involving the irredundance number of a graph