•  
  •  
 

Keywords

Graph, Adjacency matrix, Property (R), Property (SR).

Abstract

In this paper, only simple graphs are considered. A graph G is nonsingular if its adjacency matrix A(G) is nonsingular. A nonsingular graph G satisfies reciprocal eigenvalue property (property R) if the reciprocal of each eigenvalue of the adjacency matrix A(G) is also an eigenvalue of A(G) and G satisfies strong reciprocal eigenvalue property (property SR) if the reciprocal of each eigenvalue of the adjacency matrix A(G) is also an eigenvalue of A(G) and they both have the same multiplicities. From the definitions property SR implies property R. Furthermore, for some classes of graphs (for example, trees), it is known that these properties are equivalent. However, the equivalence of these two properties is not yet known for any nonsingular graph. In this article, it is shown that these properties are not equivalent in general.

abs_vol31_pp511-514.pdf (26 kB)
Abstract

Share

COinS
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.