Properties of minimal dominating functions of graphs
Date
2010-03-04T22:56:14Z
Authors
Cockayne, E.J.
Fricke, G.
Hedetniemi, S.T.
Mynhardt, C.M.
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
A dominating function for a graph is a function from its vertex set into the unit interval so that the sum of function values taken over the closed neighbourhood of each vertex is at least one. We prove that any graph has a positive minimal dominating function and begin an investigation of the question: When are convex combinations of minimal dominating functions themselves minimal dominating?
Description
Keywords
technical reports (mathematics and statistics)