#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2001

2007

- This year (0)
- Last 5 years (0)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

A cross-sectional matched control study was designed to investigate the impact of hospitalization and MRSA isolation on the psychological functioning of older adults undergoing rehabilitation.Twenty-two MRSA-positive and 20 MRSA-negative older adults completed standardized measures relating to depression, anxiety and anger. Both groups of participants had… (More)

Let Rm be the (unique) universal homogeneous m-edge-coloured countable complete graph (m ≥ 2), and Gm its group of colourpreserving automorphisms. The group Gm was shown to be simple by John Truss. We examine the automorphism group of Gm, and show that it is the group of permutations of Rm which induce permutations on the colours, and hence an extension of… (More)

- Peter J. Cameron, Sam Tarzi
- Eur. J. Comb.
- 2004

The operation of switching a finite graph was introduced by Seidel, in the study of strongly regular graphs. We may conveniently regard a graph as being a 2-colouring of a complete graph; then the extension to switching of an m-coloured complete graph is easy to define. However, the situation is very different. For m > 2, all m-coloured graphs lie in the… (More)

We investigate the filter generated by vertex neighbourhoods in the countable random graph R, and two related topologies, with emphasis on their automorphism groups. These include a number of highly transitive groups containing Aut(R).

- ‹
- 1
- ›