4171 search results - page 59 / 835 » Choice numbers of graphs |
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
— In this paper we examine the leader-to-follower ratio needed to maintain connectivity in a leader-follower multiagent network with proximity based communication topology. In th...
DM
2008
14 years 12 months ago
2008
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 ...
APPML
2008
14 years 12 months ago
2008
The following fundamental result for the domination number (G) of a graph G was proved by Alon and Spencer, Arnautov, Lov
MST
2006
14 years 11 months ago
2006
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
123
click to vote
IWPEC
2004
Springer
15 years 5 months ago
2004
Springer
Let G = V; E be a graph. The linear-width of G is de ned as the smallest integer k such that E can be arranged in a linear ordering e1; : : : ; er such that for every i = 1; :...