• Publications
  • Influence
Graph theory
Flows in Networks.
In this classic book, first published in 1962, L. R. Ford, Jr., and D. R. Fulkerson set the foundation for the study of network flow problems. The models and algorithms introduced in Flows in
Structural balance: a generalization of Heider's theory.
TLDR
Heider (19), reflecting the general field-theoretical approach, has considered certain aspects of cognitive fields which contain perceived people and impersonal objects or events.
Graphical enumeration
TLDR
The labeled and unlabeled enumeration of graphs, connected graphs, trees, eulerian graphs etc. is discussed.
Distance in graphs
On the corona of two graphs
Our object in this note is to construct a new and simple operation on two graphs Gt and G2, called their corona, with the property that the group of the new graph is in general isomorphic with the
THE MAXIMUM CONNECTIVITY OF A GRAPH.
  • F. Harary
  • Mathematics, Medicine
    Proceedings of the National Academy of Sciences…
  • 1 July 1962
TLDR
The maximum diameter, and the minimum diameter are obtained and two unsolved problems concerning the distribution of the values of the connectivity and the diameter are included.
On the Number of Crossings in a Complete Graph
The purpose of this article is to describe two problems which involve drawing graphs in the plane. We will discuss both complete graphs and complete bicoloured graphs. The complete graph K n with n
...
1
2
3
4
5
...