3204 search results - page 93 / 641 » The b-chromatic Number of a Graph |
124
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
We prove the following extension of an old result of Andr
128
Voted
DM
1998
15 years 5 months ago
1998
Let β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upper irredundance number, respectively. A graph G is called Γperfect if β(H) = Γ(H),...
166
Voted
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),...
165
Voted
VIZSEC
2005
Springer
15 years 11 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...
190
click to vote
HT
2010
ACM
15 years 8 months ago
2010
ACM
We investigate the use of autonomically created small-world graphs as a framework for the long term storage of digital objects on the Web in a potentially hostile environment. We ...