3211 search results - page 119 / 643 » On the Grundy Number of a Graph |
119
click to vote
DM
2008
15 years 6 months ago
2008
Let G = (V, E) be a graph. A set S V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and to a vertex in V - S. The restrained domination numb...
128
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
We prove the following extension of an old result of Andr
171
click to vote
SPAA
2000
ACM
15 years 10 months ago
2000
ACM
In this paper, we study the design of fault tolerant networks for arrays and meshes by adding redundant nodes and edges. For a target graph G (linear array or mesh in this paper),...
171
click to vote
JGT
2010
15 years 1 months ago
2010
Thomassen [9] conjectured that for all natural numbers k > 0 and m, every graph of minimum degree k + 1 contains a cycle of length congruent to 2m modulo k. We prove that this ...
170
click to vote
VIZSEC
2005
Springer
15 years 12 months ago
2005
Springer
While efficient graph-based representations have been developed for modeling combinations of low-level network attacks, relatively little attention has been paid to effective tech...