What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Discrete mathematics
- Graph theory
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 most cited work include:
- Structural balance: a generalization of Heider's theory. (1659 citations)
- Structural Models: An Introduction to the Theory of Directed Graphs. (1110 citations)
- Distance in graphs (761 citations)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Combinatorics (66.35%)
- Discrete mathematics (48.37%)
- Graph (17.40%)
What were the highlights of his more recent work (between 1993-2018)?
- Combinatorics (66.35%)
- Discrete mathematics (48.37%)
- Graph (17.40%)
In recent papers he was focusing on the following fields of study:
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.
Between 1993 and 2018, his most popular works were:
- Eccentricity and centrality in networks (288 citations)
- The cohesiveness of blocks in social networks: Node connectivity and conditional density (193 citations)
- Double Domination in Graphs. (189 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Graph theory
- Algebra
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.
