Real and integer domination in graphs

13 years 4 months ago

Download www.cs.clemson.edu

For an arbitrary subset P of the reals, we define a function f: V P to be a Pdominating function of graph G = (V, E) if the sum of the function values over any

Wayne Goddard, Michael A. Henning

Real-time Traffic

Arbitrary Subset | DM 1999 |

claim paper

» The effect of girth on the kernelization complexity of Connected Dominating Set

» Linear kernels for connected dominating set on Hminorfree graphs

» Restricted domination parameters in graphs

» A Dominating Set Based PeertoPeer Protocol for RealTime Multisource Collaboration

» Planar Capacitated Dominating Set Is W1Hard

» Distributed algorithms for edge dominating sets

» Distributed Connected Dominating Set Construction in Geometric kDisk Graphs

» On random points in the unit disk

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1999
Where	DM
Authors	Wayne Goddard, Michael A. Henning

Comments (0)

Sciweavers

Real and integer domination in graphs

Arbitrary Subset | DM 1999 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers