Gifted with a keen sense of humor, Harary challenged and entertained audiences at all levels of mathematical sophistication.

Frank Harary was born in New York City, the oldest child to a family of Jewish immigrants from Syria and Russia.

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, Berkeley in 1948.

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.

Shortly after this publication in 1953 Harary published his first book (jointly with George Uhlenbeck) On the number of Husimi trees.

While beginning his work in graph theory around 1965, Harary began buying property in Ann Arbor, and subdividing the houses he bought into apartments.

In the time before his death, Harary traveled the world researching and publishing over 800 papers (with some 300 different co-authors), in mathematical journals and other scientific publications, more than any mathematician other than Paul Erdos.

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.

[6] 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.

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.

"[13] Harary quickly began promoting inquiry based learning through his texts, apparent by his reference to the tradition of the Moore method.

Upon squaring the adjacency matrix of the previously mentioned tree, we can observe that the theorem does in fact hold true.