Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
26
click to vote
DM
2008
favorite
Email
discuss
report
119
views
more
DM 2008
»
A generalised upper bound for the k-tuple domination number
13 years 9 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
Related Content
»
Note on Upper Bounds for TSP Domination Number
»
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
more »
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)
Researcher Info
DM 1998 Study Group
Computer Vision