3204 search results - page 375 / 641 » The b-chromatic Number of a Graph |
206
click to vote
TIT
2010
15 years 1 months ago
2010
Abstract--Motivated by applications of distributed linear estimation, distributed control, and distributed optimization, we consider the question of designing linear iterative algo...
176
click to vote
JGT
2010
15 years 5 months ago
2010
An edge-colored graph G is rainbow edge-connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, deno...
169
click to vote
RSA
2010
15 years 5 months ago
2010
We study the random graph Gn,λ/n conditioned on the event that all vertex degrees lie in some given subset S of the nonnegative integers. Subject to a certain hypothesis on S, the...
190
click to vote
ENDM
2002
15 years 6 months ago
2002
Motivated by a problem on message routing in communication networks, Graham and Pollak proposed a scheme for addressing the vertices of a graph G by N-tuples of three symbols in s...
171
click to vote
DAM
2000
15 years 6 months ago
2000
The linear-width of a graph G is de ned to be the smallest integer k such that the edges of G can be arranged in a linear ordering e1;:::;er in such a way that for every i = 1;:::...