We discuss how to find the well-covered dimension of a graph that is the Cartesian product of paths, cycles, complete graphs, and other simple graphs. Also, a bound for the well-covered dimension of K n × G is found, provided that G has a largest greedy independent decomposition of length c < n.Formulae to find the well-covered dimension of graphs obtained by vertex blowups on a known graph, and to the lexicographic product of two known graphs are also given.

The Ermington Family Learning Centre provides educational opportunities for both children with learning difficulties from low income families, and their parents. The Centre specifically targets disadvantaged children and encourages the involvement of families, most of whom are vulnerable and isolated from traditional services. Because the focus is on children, many parents who would not normally use welfare agencies or seek professional support have accepted help from the Centre. The integrated but indirect approach has ensured not only sustained educational gains and improved self esteem in the children, but improvements in family functioning and the self esteem of parents.

No abstract

No abstract