Properties of minimal dominating functions of graphs

Simple item page
dc.contributor.authorCockayne, E.J.
dc.contributor.authorFricke, G.
dc.contributor.authorHedetniemi, S.T.
dc.contributor.authorMynhardt, C.M.
dc.date.accessioned2010-03-04T22:56:14Z
dc.date.available2010-03-04T22:56:14Z
dc.date.copyright1990en
dc.date.issued2010-03-04T22:56:14Z
dc.description.abstractA 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?en
dc.description.sponsorshipNSERCen
dc.identifier.urihttp://hdl.handle.net/1828/2320
dc.language.isoenen
dc.relation.ispartofseriesDMS-547-IRen
dc.subjecttechnical reports (mathematics and statistics)
dc.subject.departmentDepartment of Mathematics and Statistics
dc.titleProperties of minimal dominating functions of graphsen
dc.typeTechnical Reporten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
DMS 547.pdf
Size:
465.4 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.84 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Faculty and Staff Publications
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.