The irredundance number and maximum degree of a graph

DOI10.1016/0012-365X(84)90118-3zbMath0539.05056MaRDI QIDQ793760

E. J. Cockayne, Béla Bollobás

Publication date: 1984

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

zbMATH Keywords

irredundancecommunication networkmaximum degreeirredundance number

Mathematics Subject Classification ID

Graph theory (05C99) Applications of graph theory to circuits and networks (94C15)

Related Items (10)

Irredundance perfect graphs ⋮ Coalescence and criticality of graphs ⋮ Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack ⋮ The complexity of irredundant sets parameterized by size ⋮ Irredundancy in circular arc graphs ⋮ A lower bound for the CO-irredundance number of a graph ⋮ Enumeration and maximum number of maximal irredundant sets for chordal graphs ⋮ Open irredundance and maximum degree in graphs ⋮ Irredundance ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters

Cites Work

• Contributions to the theory of domination, independence and irredundance in graphs
• Properties of Hereditary Hypergraphs and Middle Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: The irredundance number and maximum degree of a graph