2354 search results - page 6 / 471 » Radio number for trees |
DM
2000
14 years 9 months ago
2000
In this paper, we
NETWORKS
2008
14 years 9 months ago
2008
In this paper, we develop a method to count the number of spanning trees in certain classes of double fixed-step loop networks with nonconstant steps. More specifically our techni...
DM
2008
14 years 9 months ago
2008
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 ...
84
Voted
ALGOSENSORS
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we consider the model of communication where wireless devices can either switch their radios off to save energy (and hence, can neither send nor receive messages), o...
72
Voted
COMBINATORICS
2006
14 years 9 months ago
2006
Let G be a graph. A vertex labeling of G is distinguishing if the only label-preserving automorphism of G is the identity map. The distinguishing number of G, D(G), is the minimum...