The concept of graph inverse is motivate d by the field of quantum chemistry.

By a fine graph, Panda & Pati means an unweighted, connected, bipartite graph having a unique
perfect matching P, whereas by a finer graph, they mean a fine graph G along with the condition
that G/P is a bipartite graph. (Godsil) studies the inverse of the fine graphs. Also, he classifies
graphs which have inverses which (PP) describes as finer graphs. In (1), (PP) provides the
characterization of inverses of finer graphs. (PP) takes forward the concept of inverse of a graph
to the weighted graphs by putting unit weight on those edges which are in the matching P.

By signature similarity of a matrix M, we mean that there exists(use symbol) a diagonal matrix K
whose diagonal entries belong to {-1,1} such that(use symbol) entries of the matrix I = K M^-1
K does not belong to (-infinity,0). Godsil shows that if a graph G is finer, then M(G)^-1 is
signature similar to the matrix I. The graph (weighted) linked with symmetric matrix I is known
as inverse of G denoted by G*. One can easily see that the inverse of a finer graph is a fine
graph.

Let sigma(G) denotes the spectrum of a graph i.e. the set of all characteristic values of the
adjacency matrix of G. We say that a graph G owns property R, the reciprocal characteristic
value property if for each characteristic value c of M(G), 1/c is also a characteristic value of
M(G). If in addition, the multiplicity of both is same, then G owns the property SR. The
equivalence of the following statements is known from the literature:

1. A tree T has property R.

2. T has property SR.

Definition: [Frucht-Harary] Suppose G and H are two disjoint graphs with r and s nodes,
respectively. Take r replicas of H and one replica of G, and join jth node of G with all nodes of
the jth replica of H. The graph thus obtained is known as corona product or corona G o H of
graphs G and H. When H = K_1, we say G o H a basic corona.

In [BarikNeumannPati], the trees having property R are identified. McKay [ ] and Cvetkovic et
al. [ ] in 1978 have proved that the following statements for a tree T are equivalent:

1. T = T_’ o K_1 ; T’ is a tree.

3. T possess property SR.
[NP] characterizes the weighted, non-singular trees having a minimum of 8 nodes satisfying the
property R. They provide this characterization under the restriction on the weights of matching
and non-matching edges which are considered as 1 and at least 1 respectively. The
characterization is as follows:

Result: [13] Suppose that we are given a non-singular tree E having a minimum of 8 nodes. A
necessary and sufficient condition for E to possess property R is that E = E_’ o K_1 i.e. E is
corona of the tree E_’ where E_’ is a tree having at least 1 weight on every edge.

What if we lower the restrictions on the edge-weights? Does the result still hold? Neumann and
Pati pose an open problem linked with it. Does the above result hold even when we make a
change in the weight of non-matching edges from at least 1 to at least 0 in our restriction? Panda
and Pati figure out this problem and come with an affirmative solution. They provide a class of
graphs which possess property R. It is interesting to see that such graphs are corona of weighted,
bipartite graphs.

Definition: A weighted fine graph such that the associated unweighted graph is a finer graph is
known as w-finer graph.

In [2], Godsil proves theorem 2.2 for the non-weighted graphs. Panda and Pati take forward this
result to the weighted graphs and obtain the following:

Result: If W_G is a w-finer graph, then inverse graph W_G_* exists. Also for a permutation
matrix M_P of the matching, M_P^-1 M(W_G_*) M_P dominates M(W_G).

With the help of above result, Panda and Pati provide a characteristic for a w-finer graph to be
isomorphic with its inverse graph. They show that a necessary and sufficient condition for a w-
finer graph W_G to be isomorphic with its inverse graph is 1/(delta) is the smallest characteristic
value of M(W_G) where (delta) (> 0) is the spectral radius of M(W_G). Also they observe that if
a w-finer graph W_G is isomorphic to its inverse graph, then W_G = W_G^* o K_1 where
W_G^* is a connected, positive-weighted, bipartite graph. From the literature, it is known that a
w-finer graph which is a basic corona of a bipartite, connected, positive-weighted graph satisfies
property SR. If we combine this with the above findings of [1], we get the following equivalent
statements for a w-finer graph W_G:
1. W_G satisfy property R.
2. W_G is isomorphic to W_G_*.
3. W_G is a basic corona of a connected, bipartite, positive-weighted graph.
4. W_G satisfy property SR.