### Table 2. Lower bound on independence ratio of all d-regular graphs with girth at least 2k + 3.

"... In PAGE 5: ...(d, p1, . . . , pk). Note that every choice of pi gives a lower bound on the independence ratio. Lower bounds on the function being maximised are given in Table2 for some specific values of k and d, obtained by setting pi = p for all i.... ..."

### Table 1. Bounds on c(G) for a random d-regular graph, G

"... In PAGE 2: ... In this way we prove an upper bound on the size of a minimum connected dominating set of random regular graphs. The columns UB in Table1 summarise our results and give a.a.... ..."

### Table 3: Results for the 50x121 node, 2-D regular mesh.

1994

Cited by 12

### Table 4: Results for the 60x285 node, 2-D regular mesh.

1994

Cited by 12

### Table 5: Results for the 200x250 node, 2-D regular mesh.

1994

Cited by 12

### Table 6: Results for the 200x400 node, 2-D regular mesh.

1994

Cited by 12

### Table 8: Results for the 23x24x25, 3-D regular mesh.

1994

Cited by 12

### Table 9: Results for the 10x20x100 node, 3-D regular mesh.

1994

Cited by 12

### Table 10: Results for the 20x20x100 node, 3-D regular mesh.

1994

Cited by 12

### Table 11: Results for the 35x45x55 node, 3-D regular mesh.

1994

Cited by 12