Sciweavers

36781 search results - page 28 / 7357
» Parameterizing by the Number of Numbers
Sort
View
DM
2008
119views more  DM 2008»
13 years 7 months ago
A generalised upper bound for the k-tuple domination number
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 ...
Andrei Gagarin, Vadim E. Zverovich
JCP
2008
145views more  JCP 2008»
13 years 7 months ago
Impact of Shift Operations on (-1+j)-Base Complex Binary Numbers
Complex numbers play a very important role in various applications of electrical and computer engineering. These days, arithmetic operations dealing with these numbers rely on a &q...
Tariq Jamil
COMBINATORICS
2002
92views more  COMBINATORICS 2002»
13 years 7 months ago
New Lower Bound Formulas for Multicolored Ramsey Numbers
We give two lower bound formulas for multicolored Ramsey numbers. These formulas improve the bounds for several small multicolored Ramsey numbers.
Aaron Robertson
DM
2008
139views more  DM 2008»
13 years 7 months ago
On domination and reinforcement numbers in trees
The reinforcement number of a graph is the smallest number of edges that have to be added to a graph to reduce the domination number. We introduce the k-reinforcement number of a ...
Jean R. S. Blair, Wayne Goddard, Stephen T. Hedetn...
ARSCOM
2004
124views more  ARSCOM 2004»
13 years 7 months ago
The Domatic Number of Regular Graphs
The domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular g...
Peter Dankelmann, Neil J. Calkin