Frank Harary

Frank Harary (left) and Klaus Wagner in Oberwolfach, 1972

Frank Harary (March 11, 1921 – January 4, 2005) was an American mathematician, who specialized in graph theory. He was widely recognized as one of the "fathers" of modern graph theory.[1] Harary was a master of clear exposition and, together with his many doctoral students, he standardized the terminology of graphs. He broadened the reach of this field to include physics, psychology, sociology, and even anthropology. Gifted with a keen sense of humor, Harary challenged and entertained audiences at all levels of mathematical sophistication. A particular trick he employed was to turn theorems into games - for instance, students would try to add red edges to a graph on six vertices in order to create a red triangle, while another group of students tried to add edges to create a blue triangle (and each edge of the graph had to be either blue or red). Because of the theorem on friends and strangers, one team or the other would have to win.


Frank Harary was born in New York City, the oldest child to a family of Jewish immigrants from Syria and Morocco. He earned his bachelor's and master's degrees from Brooklyn College in 1941 and 1945 respectively[2] and his Ph.D., with supervisor Alfred L. Foster, from University of California at Berkeley in 1948.

Prior to his teaching career he became a research assistant in the Institute of Social Research at the University of Michigan.

Harary's first publication, "Atomic Boolean-like rings with finite radical", went through much effort to be put into the Duke Mathematical Journal in 1950. This article was first submitted to the American Mathematical Society in November 1948, then sent to the Duke Mathematical Journal where it was revised three times before it was finally published two years after its initial submission. Harary began his teaching career at the University of Michigan in 1953 where he was first an assistant professor, then in 1959 associate professor and in 1964 was appointed as a professor of mathematics, a position he held until 1986.

From 1987 he was Professor (and Distinguished Professor Emeritus) in the Computer Science Department at New Mexico State University in Las Cruces. He was one of the founders of the Journal of Combinatorial Theory and the Journal of Graph Theory.[1]

In 1949 Harary published On the algebraic structure of knots. Shortly after this publication in 1953 Harary published his first book (jointly with George Uhlenbeck) On the number of Husimi trees. It was following this text that Harary began to build up a worldwide reputation for his work in graph theory. In 1965 Harary's first book Structural models: An introduction to the theory of directed graphs was published, and for the rest of his life Harary's interest would be in the field of Graph Theory.

While beginning his work in graph theory around 1965, Harary began buying up property in Ann Arbor to supplement income for his family. Harary and his wife Jayne had six children together, Miriam, Natalie, Judith, Thomas, Joel and Chaya. In 1969 The Michigan Daily published an article[3] discussing issues that tenants of Harary's property were facing. Harary's motivation for purchasing these properties was in the interest of the land value, and as issues arose within the properties in terms of maintaining a safe living environment negative attention was turned towards Harary. It was Harary's intention to maintain ownership of the land and see the tenants out of their apartments while helping them find better housing.

From 1973 to 2007 Harary jointly wrote five more books, each in the field of graph theory. In the time before his death, Harary traveled the world researching and publishing papers (with some 300 different co-authors) which appeared in mathematical journals and other scientific publication. Harary recorded that he lectured in 166 different cities around the United States and some 274 cities in over 80 different countries. Harary was particularly proud that he had given lectures in cities around the world beginning with every letter of the alphabet, even including "X" when he traveled to Xanten, Germany. Harary also played a curious role in the award-winning film Good Will Hunting. The film displayed formulas he had published on the enumeration of trees, which were supposed to be fiendishly difficult.[4]

It was in 1986 at the age of 65 that Harary retired from his professorship at the University of Michigan. Harary did not take his retirement lightly however, following his retirement Harary was appointed as a Distinguished Professor of Computer Sciences at New Mexico State University in Las Cruces. He held this position until his death in 2005. The same year as his retirement Harary was made an honorary fellow of the National Academy of Sciences of India, he also served as an editor for about 20 different journals focusing primarily on graph theory and combinatorial theory. It was following his retirement that Harary was elected as an honorary lifetime member of the Calcutta Mathematical Society and of the South African Mathematical Society.

He died at Memorial Medical Center in Las Cruces, New Mexico.[5] At the time of his death in Las Cruces other members of the department of Computer Science felt the loss for the great mind that once worked beside them. The head of the department of Computer Science at the time of Harary's death Desh Ranjan had this to say, "Dr. Harary was a true scholar with a genuine love for graph theory which was an endless source of new discoveries, beauty, curiosity, surprises and joy for him till the very end of his life."


Harary's work in graph theory was diverse. Some topics of great interest to him were:

Among over 700 scholarly articles Harary wrote, two were co-authored with Paul Erdős, giving Harary an Erdős number of 1.[11] He lectured extensively and kept alphabetical lists of the cities where he spoke.

Harary's most famous classic book Graph Theory was published in 1969 and offered a practical introduction to the field of graph theory. It is evident that Harary's focus in this book and amongst his other publications was towards the varied and diverse application of graph theory to other fields of mathematics, physics and many others. Taken from the preface of Graph Theory, Harary notes...

"...there are applications of graph theory to some areas of physics, chemistry, communication science, computer technology, electrical and civil engineering, architecture, operational research, genetics, psychology, sociology, economics, anthropology, and linguistics."[12]

Harary quickly began promoting inquiry based learning through his texts, apparent by his reference to the tradition of the Moore method. Harary made many unique contributions to graph theory as he explored more and more different fields of study and successfully attempted to relate them to graph theory. Harary's classic book Graph Theory begins by providing the reader with much of the requisite knowledge of basic graphs and then dives right into proving the diversity of content that is held within graph theory. Some of the other mathematical fields that Harary directly relates to graph theory in his book begin to appear around chapter 13, these topics include linear algebra, and abstract algebra.

Tree square root

One motivation for the study of graph theory is its application to sociograms described by Jacob L. Moreno. For instance the adjacency matrix of a sociogram was used by Leon Festinger.[13] Festinger identified the graph theory clique with the social clique and examined the diagonal of the cube of a groups’ adjacency matrix to detect cliques. Harary joined with Ian Ross to improve on Festinger's clique detection.[14]

The admission of powers of an adjacency matrix led Harary and Ross to note that a complete graph can be obtained from the square of an adjacency matrix of a tree. Relying on their study of clique detection, they described a class of graphs for which the adjacency matrix is the square of the adjacency matrix of a tree.[15]

Iff a graph G is complete or satisfies the following 5 properties then G = T2
(i) Every point of G is neighborly and G is connected.
(ii) If two cliques meet at only one point b, then there is a third clique with which they share b and exactly one other point.
(iii) There is a 1-1 correspondence between the cliques and the multicliqual points b of G such that clique C(b) corresponding to b contains exactly as many multicliqual points as the number of cliques which include b.
(iv) No two cliques intersect in more than two points.
(v) The number of pairs of cliques that meet in two points is one less than the number of cliques.
Step 1: Find all the cliques of G.
Step 2: Let the cliques of G be C1,...,Cn, and consider a collection of multicliqual points b1,...,bn corresponding to these cliques in accordance with condition iii. The elements of this collection are the nonendpoints of T. Find all of the pairwise intersections of the n cliques and form the graph S by joining the points bi and bj by a line if and only if the corresponding cliques Ci and Cj intersect in two points. S is then a tree by condition v.
Step 3: For each clique Ci of G, let ni be the number of unicliqual points. To the tree S obtained in step 2, attach ni endpoints to bi, obtaining the tree T which we sought.

Once we have the tree in question we can create an adjacency matrix for the tree T and check that it is indeed to correct tree which we sought. Squaring the adjacency matrix of T should yield an adjacency matrix for a graph which is isomorphic to the graph G which we started with. Probably the simplest way to observe this theorem in action is to observe the case which Harary mentions in The Square of a Tree. Specifically the example in question describes the tree corresponding the graph of K5

"Consider the tree consisting of one point joined with all the others. When the tree is squared, the result is the complete graph. We wish to illustrate... T2K5"

Upon squaring of the adjacency matrix of the previously mentioned tree, we can observe that this theorem does in fact hold true. We can also observe that this pattern of setting up a tree where "one point joined with all the others" will always indeed yield the correct tree for all complete graphs.


See also


  1. 1 2 Frank Harary, a biographical sketch at the ACM SIGACT site
  2. Frank Harary 1921-2005 - Columbia University
  3. "The quixotic adventure of Frank Harary or how land speculation or city hall's neglect have contributed to Ann Arbor’s low-income housing shortage", The Michigan Daily April 17, 1969, page 5
  4. Queena N. Lee-Chua (October 13, 2001) The Father of Modern Graph Theory, Philippine Daily Inquirer, link from Google News
  5. Alba, Diana M. (2005-01-07). "Late NMSU prof had noted career". Las Cruces Sun-News. p. 1A.
  6. Harary, Frank (1955), "The number of linear, directed, rooted, and connected graphs", Transactions of the American Mathematical Society, 78: 445–463, doi:10.1090/S0002-9947-1955-0068198-2, MR 0068198.
  7. Harary, F. (1953-54) "On the notion of balance of a signed graph", Michigan Mathematical Journal 2: 143-146 and addendum preceding p. 1.
  8. F. Harary (1955) On local balance and N-balance in signed graphs, Michigan Mathematical Journal 3: 37 to 41 link from Project Euclid
  9. Cartwright, D. and Harary, F. (1956)Structural balance: a generalization of Heider's theory, Psychological Review 63: 277-293 link from Stanford University
  10. Harary, Frank; Moser, Leo (1966), "The theory of round robin tournaments", American Mathematical Monthly, 73 (3): 231–246, doi:10.2307/2315334, JSTOR 2315334
  11. List of people by Erdős number
  12. Frank Harary (1969) Graph Theory, Addison–Wesley
  13. Festinger, L. (1949) "The analysis of sociograms using matrix algebra", Human Relations 2: 152–8
  14. F. Harary & Ian Ross (1957) "A procedure for clique detection using the group matrix", Sociometry 20: 205–15 MR 0110590
  15. F. Harary & Ian Ross (1960) ) The square of a tree, Bell System Technical Journal 39(3):641 to 47 MR 0115937

External links

This article is issued from Wikipedia - version of the 8/12/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.