Irredundant and perfect neighbourhood sets in trees

DOI10.1016/S0012-365X(98)00029-6zbMath0955.05027OpenAlexW2104721876MaRDI QIDQ1584343

E. J. Cockayne, Sandra M. Hedetniemi, Stephen T. Hedetniemi, Christina M. Mynhardt

Publication date: 2 November 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00029-6

zbMATH Keywords

treeirredundant setperfect neighbourhood set

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Related Items

Enumeration and maximum number of maximal irredundant sets for chordal graphs, The Private Neighbor Concept, Irredundant and perfect neighborhood sets in graphs and claw-free graphs, On perfect neighborhood sets in graphs

Cites Work

• Bibliography on domination in graphs and some basic definitions of domination parameters
• Unnamed Item