Real and integer domination in graphs

DOI10.1016/S0012-365X(98)00286-6zbMath0928.05048WikidataQ126758801 ScholiaQ126758801MaRDI QIDQ1297432

Michael A. Henning, Wayne Goddard

Publication date: 9 January 2000

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

zbMATH Keywords

numerical invariants\(P\)-dominating functions\(P\)-domination number\(P\)-independence numberinteger domination

Mathematics Subject Classification ID

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

Related Items

A short proof of a result on a Vizing-like problem for integer total domination, Fractional Dominating Parameters, Linear programming approach for various domination parameters

Cites Work

• A new polynomial-time algorithm for linear programming
• Domination, independent domination, and duality in strongly chordal graphs
• Bibliography on domination in graphs and some basic definitions of domination parameters
• Generalized domination and efficient domination in graphs
• Minus domination in graphs
• Fractional domination of strong direct products
• The algorithmic complexity of minus domination in graphs
• Dominating Sets in Chordal Graphs
• Bounds on Positive Integral Solutions of Linear Diophantine Equations
• Towards a theory of domination in graphs
• Domination, Fractional Domination, 2-Packing, and Graph Products
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item