We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph of some semigroup. Moreover, we obtain complete classifications of the graphs with an isolated vertex or edge that are the commuting graph of a group and the cycles that are the commuting graph of a centrefree semigroup.

Models have been proposed in many diverse areas to generate a lognormal distribution and the underlying idea has always been some form of the law of proportionate effect. In a sense any model must resemble this recipe: take logs and apply the central limit theorem. Our model is no exception. However our formulation is designed to encompass the previous models and demonstrate that the fundamental concept is one of classification. This supersedes a multitude of models which incorporate a mechanism peculiar to a specific application in order to use the law of proportionate effect; we illustrate with applications of the model to ecology, econometrics and geostatistics.