# Frank Harary

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2012

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

- Discrete Applied Mathematics
- 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)

Is this relevant?

2009

2009

- 2009

This provides a nice connection between two knot invariants, the determinant, which is relatively easy to calculate, for example… (More)

Is this relevant?

2005

2005

- Discrete Mathematics
- 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

- Discrete Applied Mathematics
- 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)

Is this relevant?

2001

2001

- ArXiv
- 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)

Is this relevant?

1998

1998

- Inf. Process. Lett.
- 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)

Is this relevant?

1994

1994

- Discrete Mathematics
- 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)

Is this relevant?

1994

1994

- Discrete Mathematics
- 1994

We introduce the closed-neighborhood intersection multigraph as a useful multigraph version of the square of a graph. We… (More)

Is this relevant?

1987

1987

- Graphs and Combinatorics
- 1987

The reconstruction number rn(G) of a graph G was introduced by Harary and Plantholt as the smallest number of vertex-deleted… (More)

Is this relevant?