3204 search results - page 93 / 641 » The b-chromatic Number of a Graph |
COMBINATORICS
2006
13 years 10 months ago
2006
We prove the following extension of an old result of Andr
DM
1998
13 years 9 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),...
SPAA
2000
ACM
14 years 2 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),...
VIZSEC
2005
Springer
14 years 3 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...
HT
2010
ACM
14 years 3 days 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 ...