Premium
Comment on ‘Topological Analysis of the Eigenvalues of the Adjacency Matrices in Graph Theory: A Difficulty with the Concept of Internal Connectivity’
Author(s) -
Lee ShyiLong
Publication year - 1989
Publication title -
journal of the chinese chemical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.329
H-Index - 45
eISSN - 2192-6549
pISSN - 0009-4536
DOI - 10.1002/jccs.198900010
Subject(s) - adjacency matrix , eigenvalues and eigenvectors , degenerate energy levels , weighting , simple (philosophy) , adjacency list , graph energy , combinatorics , graph theory , enhanced data rates for gsm evolution , matrix (chemical analysis) , graph , mathematics , chemistry , computer science , line graph , artificial intelligence , quantum mechanics , physics , epistemology , philosophy , chromatography , acoustics , graph power
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.