FAQ
Intro
Survey
Topics
Please select the name from the list.
If the name is not there, means it is not connected with a GND -ID?

GND: 117711330


Click on a term to reduce result list Information symbol The result list below will be reduced to the selected search terms. The terms are generated from the titles, abstracts and STW thesaurus of publications by the respective author.

b

Match by:
Sort by:

The information on the author is retrieved from: Entity Facts (by DNB = German National Library data service), DBPedia and Wikidata

Frank Harary


Alternative spellings:
F. Harary

B: 11. März 1921
D: 4. Januar 2005
Biblio: Professor an der Univ. of Michigan, später Professor of Computer Science an der New Mexico State Univ.; Schwerpunkt: Graphentheorie
The image of the author or topic
Source: Wikimedia Commons

Information about the license status of integrated media files (e.g. pictures or videos) can usually be called up by clicking on the Wikimedia Commons URL above.

Profession

  • Mathematiker
  • External links

  • Gemeinsame Normdatei (GND) im Katalog der Deutschen Nationalbibliothek
  • Bibliothèque nationale de France
  • Wikipedia (Deutsch)
  • Wikipedia (English)
  • Kalliope Verbundkatalog
  • Deutsche Digitale Bibliothek
  • NACO Authority File
  • Virtual International Authority File (VIAF)
  • Wikidata
  • International Standard Name Identifier (ISNI)

  • Official Website logo Official Website


    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.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. (Source: DBPedia)

    Publishing years

    1
      1974
    1
      1973
    1
      1965

    Series