Sasmita Barik

Let G be a simple connected graph and A(G) be its adjacency matrix. A nonsingular graph G is said to have the reciprocal eigenvalue property if the reciprocal of each eigenvalue of G is also an eigenvalue. Furthermore, if each eigenvalue of G and its...

Let G be a simple connected graph and A(G) be its adjacency matrix. A nonsingular graph G is said to have the reciprocal eigenvalue property if the reciprocal of each eigenvalue of G is also an eigenvalue. Furthermore, if each eigenvalue of G and its...