Open irredundance and maximum degree in graphs

DOI10.1016/j.disc.2007.10.002zbMath1207.05095OpenAlexW2040241884MaRDI QIDQ998417

E. J. Cockayne, Odile Favaron, Stephen Finbow, Christina M. Mynhardt

Publication date: 28 January 2009

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

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

zbMATH Keywords

maximal open irredundant set of verticesOC-irredundanceopen irredundance

Mathematics Subject Classification ID

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

Related Items (3)

A lower bound for the CO-irredundance number of a graph ⋮ Irredundance ⋮ The Private Neighbor Concept

Cites Work

• The irredundance number and maximum degree of a graph
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Open irredundance and maximum degree in graphs