His scientific interests lie mostly in Combinatorics, Discrete mathematics, Graph, Graph theory and Indifference graph. Frank Harary interconnects Plane and Convexity in the investigation of issues within Combinatorics. His is doing research in Bound graph, Line graph, Complement graph, Ramsey theory and Ramsey's theorem, both of which are found in Discrete mathematics.
Many of his research projects under Graph are closely connected to Spectral line and General problem with Spectral line and General problem, tying the diverse disciplines of science together. The study incorporates disciplines such as Theoretical computer science, Combinatorial design, Unit and Forcing in addition to Graph theory. His Indifference graph research is multidisciplinary, relying on both Pathwidth and Chordal graph.
His primary areas of study are Combinatorics, Discrete mathematics, Graph, Graph theory and Line graph. Indifference graph, Chordal graph, Pathwidth, 1-planar graph and Graph are subfields of Combinatorics in which his conducts study. His research related to Symmetric graph, Connectivity, Hypercube, Graph power and Ramsey's theorem might be considered part of Discrete mathematics.
Voltage graph, Complement graph, Block graph and Factor-critical graph are among the areas of Line graph where Frank Harary concentrates his study. Null graph and Cubic graph are the primary areas of interest in his Voltage graph study. His work carried out in the field of Null graph brings together such families of science as Graph property and Butterfly graph.
Frank Harary spends much of his time researching Combinatorics, Discrete mathematics, Graph, Graph theory and Line graph. His work in Combinatorics tackles topics such as Planar which are related to areas like Lattice. His Discrete mathematics study frequently draws connections between adjacent fields such as Cardinality.
His research in Graph intersects with topics in Chromatic scale and Upper and lower bounds. His Graph theory research is multidisciplinary, incorporating perspectives in Theoretical computer science and Automorphism. His Connectivity study integrates concerns from other disciplines, such as Geodetic datum and Geodesic.
Frank Harary mostly deals with Combinatorics, Discrete mathematics, Graph, Graph theory and Line graph. His research integrates issues of Geodetic datum, Index and Kinship in his study of Combinatorics. His work on Bound graph as part of general Discrete mathematics research is often related to Cohesion, thus linking different fields of science.
In general Graph, his work in Dominating set, Bipartite graph and Signed graph is often linked to Group structure linking many areas of study. His Graph theory study incorporates themes from Animation, Computer graphics and Learning object. The various areas that Frank Harary examines in his Complement graph study include Symmetric graph and Edge-transitive graph.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Structural balance: a generalization of Heider's theory.
Dorwin Cartwright;Frank Harary.
Psychological Review (1956)
Structural Models: An Introduction to the Theory of Directed Graphs.
Robert P. Abelson;Frank Harary;Robert Z. Norman;Dorwin Cartwright.
Journal of the American Statistical Association (1966)
Distance in graphs
Fred Buckley;Frank Harary.
On the notion of balance of a signed graph.
Michigan Mathematical Journal (1953)
Eccentricity and centrality in networks
Per Hage;Frank Harary.
Social Networks (1995)
THE MAXIMUM CONNECTIVITY OF A GRAPH.
Proceedings of the National Academy of Sciences of the United States of America (1962)
On the Corona of Two Graphs.
Roberto Frucht;Frank Harary.
Aequationes Mathematicae (1970)
A survey of the theory of hypercube graphs
Frank Harary;John P. Hayes;Horng Jyh Wu.
Computers & Mathematics With Applications (1988)
On eulerian and hamiltonian graphs and line graphs
Frank Harary;C. St. J. A. Nash-Williams.
Canadian Mathematical Bulletin (1965)
Planar Permutation Graphs
Gary Chartrand;Frank Harary.
Annales De L Institut Henri Poincare-probabilites Et Statistiques (1967)
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: