Frank Harary

Known as: Harary 
Frank Harary (March 11, 1921 – January 4, 2005) was an American mathematician, who specialized in graph theory. He was widely recognized as one of… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Recently, a new molecular graph matrix, Harary matrix, was defined in honor of Professor Frank Harary, and new graph invariants… (More)
Is this relevant?
2012
2012
The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. In this… (More)
  • figure 1
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
2009
2009
This provides a nice connection between two knot invariants, the determinant, which is relatively easy to calculate, for example… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2005
2005
An identity orientation of a graph G= (V ,E) is an orientation of some of the edges of E such that the resulting partially… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Let G=(V; E) be a connected graph and S ⊂E. S is said to be a m-restricted edge cut (m-RC) if G − S is disconnected and each… (More)
  • figure 1
Is this relevant?
2001
2001
In the graph avoidance game two players alternatingly color edges of a graph G in red and in blue respectively. The player who… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1998
1998
We derive upper and lower asymptotic bounds on the minimum number of edges of K,, that need to be oriented in order to break all… (More)
  • figure 1
Is this relevant?
1994
1994
We introduced the sum graph of a set S of positive integers as the graph G+(S) having S as its node set, with two nodes adjacent… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
1994
1994
We introduce the closed-neighborhood intersection multigraph as a useful multigraph version of the square of a graph. We… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1987
1987
The reconstruction number rn(G) of a graph G was introduced by Harary and Plantholt as the smallest number of vertex-deleted… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 4
Is this relevant?