1545 search results - page 50 / 309 » On tree congestion of graphs |
ICDCN
2009
Springer
15 years 2 months ago
2009
Springer
Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query r...
104
click to vote
AUTOMATICA
2010
14 years 10 months ago
2010
The spectral properties of the incidence matrix of the communication graph are exploited to provide solutions to two multiagent control problems. In particular, we consider the pr...
111
click to vote
GC
2008
Springer
14 years 9 months ago
2008
Springer
In this paper we study the class of weakly quasi-threshold graphs that are obtained from a vertex by recursively applying the operations (i) adding a new isolated vertex, (ii) addi...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
It is well known that the spectral radius of a tree whose maximum degree is ∆ cannot exceed 2 √
APVIS
2007
14 years 11 months ago
2007
In this paper, we consider the problem of navigating graphs drawn in 2.5 dimensions. First, we define criteria for good navigation and then present various methods to satisfy som...