Exact colorations of graphs and digraphs

A coloration is an exact regular coloration if whenever two vertices are colored the same they have identically colored neighborhoods. For example, if one of the two vertices that are colored the same is connected to three yellow vertices, two white and red, then the other vertex is as well. Exact regular colorations have been discussed informally in the social network literature. However they have been part of the mathematical literature for some time, though in a different format. We explore this concept in terms of social networks and illustrate some important results taken from the mathematical literature. In addition we show how the concept can be extended to ecological and perfect colorations, and discuss how the CATREGE algorithm can be extended to find the maximal exact regular coloration of a graph.

On "fitting in": the effects of social context and gender on big 5 trait expression.

[This is a summary of an Oral Presentation] The study explored the expression of Big 5 personality traits in three different social contexts (with parents friends and work colleagues) to test the prediction that personality is socially variable due to the motivation to ‘fit in’. The questionnaire-based method produced results that support this hypothesis; all Big 5 traits were significantly variable across contexts with Conscientiousness the least variable and Extraversion possessiveness. The results indicated that females reported being more distressed than males and older respondents reported being less distressed then younger respondents. The findings from this study contribute to the literature on online infidelity in terms of understanding differences in the way it is perceived.