Abstract
What is a graph? To the majority of people the word “graph” conjures up a picture either of the kind of businessman’s chart shown in Figure 1, or of a smooth curve, like Figure 2, which displays the property of some mathematical function. But to a large and growing number of mathematicians this same word suggests something completely different. These are the people who are concerned, in one way or another, with the branch of mathematics known as graph theory. When they think of a graph they
have in mind a diagram consisting of a number of points, or nodes, and lines or curves joining some of these nodes to others. These lines are often called edges; an example is given in Figure 3. (Most of the other figures in this article depict graphs of one sort or another.) These objects are what the man in the street would tend to refer to as networks (a word that graph theorists use in a somewhat special sense).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Bibliography
deBruijn, N. G. Generalization of Pólya’s fundamental theorem in enumerative combinatorial analysis. Indag. Math. 21: 59–69.
Cayley, A. 1857. On the theory of the analytical forms called trees. Phil. Mag. 13: 172–176.
Cayley, A. 1874. On the mathematical theory of isomers. Phil. Mag. 47: 444–446.
Cayley, A. 1875. On the analytical forms called trees, with applications to the theory of chemical compounds. Rep. Brit. Ass. 257–305.
Harary, F. 1955. The number of linear, directed, rooted and connected graphs. Trans. Amer. Math. Soc. 78: 445–463.
Harary, F. 1969. Graph Theory Reading, Massachusetts: Addison-Wesley.
Harary, F. and Palmer, E. M. 1973. Graphical enumeration. New York: Academic Press.
King, C. A. and Palmer, E. M. Calculation of the number of graphs of order p = 1(1)24. (unpublished.)
Pólya, G. 1937. Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen. Acta Math 68: 145–254.
Read, R. C. 1963. On the number of self-complementary graphs and digraphs. J. London Math. Soc. 38: 99–104.
Redfield, J. H. 1927. The theory of group-reduced distributions. Amer. J. Math. 49: 433–455.
Tutte, W. T. 1976. Hamiltonian circuits. Colloquio Internazionale sulle Teorie Combinatorie. Atti de Convegni Lincei 17: 194–199.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Wadsworth International
About this chapter
Cite this chapter
Read, R. (1981). The Graph Theorists Who Count—and What They Count. In: Klarner, D.A. (eds) The Mathematical Gardner. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-6686-7_29
Download citation
DOI: https://doi.org/10.1007/978-1-4684-6686-7_29
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4684-6688-1
Online ISBN: 978-1-4684-6686-7
eBook Packages: Springer Book Archive