Frank Harary

Frank Harary

Frank Harary (March 11,1921January 4,2005) was a prolific American mathematician, who specialized in graph theory, widely recognized as "father" of modern graph theory.

Biography

Frank Harary was born in New York City, the oldest child to a family of Jewish immigrants from Syria and Palestine. He earned his Bachelor's and Master's degrees from Brooklyn College in 1941 and 1945 respectively and his Ph.D. from University of California at Berkeley in 1948. During 1948-1986 he was with the University of Michigan. Since 1987 he was Professor (and Distinguished Professor Emeritus) in the Computer Science Department at New Mexico State University in Las Cruces. He was the founder of the "Journal of Combinatorial Theory" and "Journal of Graph Theory". [http://sigact.acm.org/harary.htm Frank Harary] , a biographical sketch at the ACM SIGACT site] He passed away at Memorial Medical Center in Las Cruces. [cite news
first = Diana M.
last = Alba
title = Late NMSU prof had noted career
work = Las Cruces Sun-News
date = 2005-01-07
page = 1A
]

Mathematics

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

* Graph enumeration, that is, counting graphs of a specified kind. He coauthored a book on the subject (Harary and Palmer 1973). The main difficulty is that two graphs that are isomorphic are not counted twice; thus, one has to apply Polya's theory of counting under group action. Harary was an expert in this.
* Signed graphs. Harary invented this branch of graph theory [Harary, F. (1953-54), On the notion of balance of a signed graph. Michigan Math. Journal, vol. 2, pp. 143-146 and addendum preceding p. 1.] , which grew out of a problem of theoretical social psychology investigated by the psychologist Dorwin Cartwright and Harary [Cartwright, D. and Harary, F. (1956), Structural balance: a generalization of Heider's theory. Psychological Review, vol. 63, pp. 277-293.]
* Applications of graph theory in numerous areas. He was co-author of John Wiley's first eBook, Graph Theory and Geography.

Among over 700 scholarly articles Harary authored, two were co-authored with Paul Erdős [http://www.oakland.edu/enp/erdtrib.pdf] , giving Harary an Erdős number of 1.

Bibliography

* Harary, Frank, "Graph Theory" (1969), Addison–Wesley, Reading, MA.
* Harary, Frank, and Palmer, Edgar M., "Graphical Enumeration" (1973), Academic Press, New York, NY.
* Arlinghaus, Sandra Lach; Arlinghaus, William C.; Harary, Frank. Graph Theory and Geography: An Interactive E-Book. New York: John Wiley and Sons, 2002.

References

External links

*MathGenealogy|id=7684
* [http://www.cs.nmsu.edu/fnh/ Harary's home page]


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Frank Harary — Klaus Wagner (rechts) und Frank Harary in Oberwolfach, 1972 Frank Harary (* 11. März 1921 in New York City; † 4. Januar 2005 in Las Cruces, New Mexico) war ein US amerikanischer Mathematiker, dessen Arbeitsgebiet die Graphentheorie und ihre… …   Deutsch Wikipedia

  • Harary — is a popular last name of Jews of Moroccan and Syrian descent. Many Moroccan Jews upon emigration to Israel in the 1950 s hebraicised the original surname, Elharar, to Harary. Harary may refer to:* Frank Harary ** Harary s generalized tic tac toe …   Wikipedia

  • Harary's generalized tic-tac-toe — is an even broader generalization of tic tac toe than m,n,k games are. Instead of the goal being limited to in a row constructions, the goal can be any polyomino (Note that when this generalization is made diagonal constructions are not… …   Wikipedia

  • Harary — Klaus Wagner und Frank Harary in Oberwolfach, 1972 Frank Harary (* 11. März 1921 in New York City; † 4. Januar 2005 in Las Cruces, New Mexico) war ein US amerikanischer Mathematiker, dessen Arbeitsgebiet die Graphentheorie und ihre Anwendu …   Deutsch Wikipedia

  • Харари, Фрэнк — Фрэнк Харари Frank Harary Дата рождения: 11 марта 1921(1921 03 11) Место рождения: Нью Йорк, США Дата смерти …   Википедия

  • Graphe planaire extérieur — Un graphe planaire extérieur maximal, muni d un 3 coloriage. En mathématiques, et plus particulièrement en théorie des graphes, un graphe non orienté est planaire extérieur (ou, par calque de l anglais, outer planar) s il peut être dessiné dans… …   Wikipédia en Français

  • New digraph reconstruction conjecture — Unsolved problems in mathematics Are digraphs uniquely determined by their subgraphs? The reconstruction conjecture of Stanislaw Ulam is one of the best known open problems in graph theory. Using the terminology of Frank Harary[1] it can be… …   Wikipedia

  • Liste der Biografien/Haq–Har — Biografien: A B C D E F G H I J K L M N O P Q …   Deutsch Wikipedia

  • Liste der Biografien/Har — Biografien: A B C D E F G H I J K L M N O P Q …   Deutsch Wikipedia

  • Hypercube (Graphe) — Pour les articles homonymes, voir Hypercube (homonymie).   Cette page se comprend mieux après la lecture de Théorie des graphes. Hypercube …   Wikipédia en Français

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”