A generalised upper bound for the k-tuple domination number

13 years 4 months ago

Download www.cems.uwe.ac.uk

In this paper, we provide an upper bound for the k-tuple domination number that generalises known upper bounds for the double and triple domination numbers. We prove that for any graph G,

Andrei Gagarin, Vadim E. Zverovich

Real-time Traffic

DM 2008 | Domination Number | K-tuple Domination Number | Upper Bounds |

claim paper

» The upper bound on ktuple domination numbers of graphs

» A New Upper Bound on the Total Domination Number of a Graph

» maxcut and Containment Relations in Graphs

» Dominating direct products of graphs

» Multihour network planning based on domination between sets of traffic matrices

» Star forests dominating sets and Ramseytype problems

» Acyclic dominating partitions

» Domination in Graphs of Minimum Degree at least Two and Large Girth

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	DM
Authors	Andrei Gagarin, Vadim E. Zverovich

Comments (0)

Sciweavers

A generalised upper bound for the k-tuple domination number

DM 2008 | Domination Number | K-tuple Domination Number | Upper Bounds |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers