On generalised minimal domination parameters for paths

DOI10.1016/0012-365X(90)90352-IzbMath0744.05056OpenAlexW2017106730MaRDI QIDQ1174129

Béla Bollobás, E. J. Cockayne, Christina M. Mynhardt

Publication date: 25 June 1992

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

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90352-i

zbMATH Keywords

\(k\)-minimal dominating set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graph theory (05C99)

Related Items (7)

An anonymous self-stabilizing algorithm for 1-maximal independent set in trees ⋮ Matchability and \(k\)-maximal matchings ⋮ Self-stabilizing 2-minimal dominating set algorithms based on loop composition ⋮ Nearly perfect sets in graphs ⋮ Interpolation theorems for graphs, hypergraphs and matroids ⋮ The sequence of upper and lower domination, independence and irredundance numbers of a graph ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters

Cites Work

• Unnamed Item
• Unnamed Item
• Gallai theorems for graphs, hypergraphs, and set systems
• Bibliography on domination in graphs and some basic definitions of domination parameters
• Hereditary properties of raphs
• Atom probe tomography characterization of solute segregation to dislocations and interfaces

This page was built for publication: On generalised minimal domination parameters for paths