Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

92

Voted

COMBINATORICS
2007

84views more COMBINATORICS 2007»

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

15 years 2 months ago

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

Download www.combinatorics.org

Michael A. Henning, Anders Yeo

Real-time Traffic

COMBINATORICS 2007 |

claim paper

Related Content

» A generalised upper bound for the ktuple domination number

» The upper bound on ktuple domination numbers of graphs

» Total Domination and Matching Numbers in ClawFree Graphs

» Simultaneous graph parameters Factor domination and factor total domination

» NordhausGaddum results for restrained domination and total restrained domination in graphs

» Total and fractional total colourings of circulant graphs

» A new upper bound on the cyclic chromatic number

» Total domination of graphs and small transversals of hypergraphs

» Ggraphs for the cage problem a new upper bound

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2007
Where	COMBINATORICS
Authors	Michael A. Henning, Anders Yeo

Comments (0)