Comment on ‘Topological Analysis of the Eigenvalues of the Adjacency Matrices in Graph Theory: A Difficulty with the Concept of Internal Connectivity’
Shyi‐Long Lee · Journal of the Chinese Chemical Society · 1989
Abstract Net signs of edge‐signed graphs obtained for different choices of degenerate eigenvectors of an adjacency matrix are shown to become equal with a simple weighting procedure. However, in a few cases, this simple procedure is found to yield orderings of the eigenvectors based on the weighted net signs which are different from the orderings based on the eigenvalues.