**Derek Waller**attended Dinnington Primary School, in his home town of Dinnington. This town, about 20 km from Sheffield and 16 km from Rotherham, had a population of about 7,500 when Waller was born there. After completing his primary education, he went to Maltby Grammar School which had opened in 1932. Its first headmaster was Gerald Rush and he was still the headmaster when Waller studied there. (Maltby is about 7 km from Dinnington.) He graduated from Maltby Grammar School in 1959 and in the October of that year he began his study of mathematics at the University of Liverpool. There he was a resident of Rathbone Hall.

Geoffrey Walker had been appointed as Professor of Pure Mathematics at the University of Liverpool in 1952. He taught Waller during his undergraduate years at Liverpool and, although Waller did not shine in the B.Sc. degree examinations, nevertheless Walker was convinced that Waller had the potential to produce good research work in mathematics. Ronnie Brown had studied at Oxford University and had been appointed as an assistant lecturer at the University of Liverpool while still working for his doctorate at Oxford. When Ronnie Brown was awarded his Ph.D. with his thesis *Some Problems in Algebraic Topology: Function Spaces and FD Complexes* in 1962 he was promoted to a lecturer at Liverpool. Walker suggested that Brown might take Waller on as his first Ph.D. student and so, after the award of his B.Sc., Waller began research at Liverpool for his doctorate. His research was in Brown's area of interest, namely algebraic topology.

In 1965, after completing three years as a research student, Waller was appointed to the University College of Swansea (since 2007 it has adopted the name Swansea University). Waller had married Susan and they set up home in Swansea. Their original plan was to stay in Swansea for two years but the many attractions that city had to offer meant that they found it impossible to leave. Susan taught at Gowerton Girls' Grammar school until the birth of their three children. Waller's first appointment was as an assistant lecturer but in 1967 he was promoted to lecturer. During his two years as an assistant lecturer, Waller continued to work on his Ph.D. thesis* The Topology of Homotopy Bundles* which he submitted to the University of Liverpool in June 1967. Some corrections were required by the examiners and he resubmitted the thesis in December 1968, graduating with his Ph.D. in the following year. He submitted his paper *On the Weak Covering Homotopy Property* to *Mathematische Zeitschrift * in November 1971. This paper, based material from his thesis, was published in 1972. Waller gives the following acknowledgement:-

Norman Biggs writes in [1]:-The author is indebted to Professor R Brown for his advice during the work involved.

Waller's talk at the British Combinatorial Conferences held in Aberystwyth in 1973 was written up asDerek Waller was a lively and respected member of the Department of Pure Mathematics at Swansea. His administrative talents were soon recognised and put to good use, and, more significantly, he began to develop as a mathematician in his own right. In1969/70he played a major part in a seminar on category theory and was coauthor of a set of lecture notes entitled 'An introduction to categories and the representation of functors'. Around this time he also became interested in the applications of linear algebra in graph theory. Thus, beginning in1973, he produced a steady stream of publications in which ideas from category theory, algebra and graph theory are intermingled. He lectured at conferences in Rome, Amsterdam and Paris, and at the British Combinatorial Conferences held in Aberystwyth(1973), Aberdeen(1975)and Royal Holloway College(1977). Because of the neatness of his work, and his attractive style of presentation, his talks were always among the highlights of these occasions.

*Eigenvalues of graphs and operations*and published in the conference proceedings. It became his first publication on graph theory. In this paper he found expressions for the eigenvalues of certain graphs constructed using graphical operations. The most important of these is the join of n regular graphs. In the above quote by Norman Biggs, there is a reference to Waller lecturing in Rome. This was at the 'Colloquio Internazionale sulle Teorie Combinatorie' held in Rome in 1973. At this conference Waller gave the lecture

*Regular eigenvalues of graphs and enumeration of spanning trees*and we give now his own introduction:-

His next paper,The theory of eigenvalues of graphs assigns to each finite graph an isomorphism invariant, viz., the spectrum(i.e., set of eigenvalues)of the adjacency matrix of the graph. Besides its intrinsic interest, this theory has applications to other aspects of graph theory, especially in the case of regular graphs. Our object is to introduce an isomorphism invariant for a graph, which we call its regular spectrum(of regular eigenvalues), which provides many advantages over the usual theory of eigenvalues. Geometrical relations between graphs(e.g., complementation, join, cone)are reflected in the properties of the regular spectrum(but not the 'usual' spectrum, except in the case of regular graphs). In short, the regular spectrum extends to irregular graphs some of the pleasant algebra enjoyed by regular graphs. Moreover, computer investigations suggest that the regular spectrum is 'more discriminating' than the usual spectrum.

*Double covers of graphs*, was published in 1976. Waller writes:-

Norman Biggs, in a review of the paper, writes:-In this paper a category-theoretical approach to graphs is used to define and study such double cover projections.

He continued to study pullbacks and gave a lecture on his results at the British Combinatorial Conferences held in Aberdeen in 1975. The talk was written up for the conference proceedings asThe author uses the terminology of category theory to discuss double coverings of graphs. For example, he shows that for each n there is a universal double cover projectionp_{U}such that any double covering of an n-colourable graph can be expressed as a pull-back ofp_{U}. The interesting question of the number of distinct(non-isomorphic)double coverings of a given graph is raised, and some preliminary results are obtained.

*Pullbacks in the category of graphs*. Ernest Gene Manes writes in a review:-

In [1] Norman Biggs explains the direction that his graph theory research led him:-The author shows that, in the category of finite undirected graphs, decomposability into a disjoint union is stable under finite products and pulling back under double cover projection.

Let us quote Waller's own summary of his paperIn his last years he became interested in applications of graph theory, particularly in chemistry['Eigenvalue methods for irregular graphs with application to spanning tree enumeration in molecular graphs'(1976), 'Covering projections of chemical reaction graphs'(1978), 'On the quest for an isomorphism invariant which characterises finite chemical graphs'(1978)]and electrical engineering['Products of graph projections as a model for multistage communication networks'(1976), 'General solution to the spanning tree enumeration problem in arbitrary multigraph joins'(1976), 'A graph-theoretical model for telecommunications networks'(1978)]. His earlier work was ripe for application in these fields. One important problem which concerned him was the estimation of the reliability of the large networks used in telecommunications systems. It seems that it is not possible to give a theoretical analysis in general, but that the problem might be amenable if the networks were constructed by the kind of product operation dealt with in his 'categorical' work. By his training and by his nature, he was attracted to such problems ...

*Products of graph projections as a model for multistage communication networks*(1976):-

One of his last papers wasThe multistage graph provides an underlying structure for conventional telephone networks. A systematic analysis in terms of channel graphs and terminal graphs is carried out using products of graph projections. A unified theory emerges and facilitates the synthesis and study of multistage switched networks of high connectivity.

*Graph-theoretical models with products and projections*(1978) and again we give here his own summary:-

Derek Waller died from leukaemia in June 1978, four days after his 37Most of the well-known applications of graph theory in operations research involve the use of one graph at a time, portraying combinatorial aspects of some problem. The object of this paper is to propose graph-theoretic models which permit the study of two or more features of a problem simultaneously. Attention is drawn to the appropriate 'product' concept for combining a number of graphs, and 'projections' which can facilitate the analysis of a large graph by relating it to a smaller one. Examples are given in which this type of graph theory has already proved to be applicable.

^{th}birthday.

After Waller's death, his wife Susan continued to teach at what was the West Glamorgan Institute and at Gorseinon College. She married Alan D Thomas who was appointed to the Mathematics Department at Swansea in 1971. Alan Thomas had published the paper *Embeddings of covering projections of graphs* (1980) coauthored with Derek Waller and Francis W Clarke. Let us note that Susan was Lord Mayor of Swansea in 2007.

**Article by:** *J J O'Connor* and *E F Robertson*