- 作者: 李錫隆
- 作者服務機構: 中央研究院化學研究所
- 中文摘要: Net signs of edge-signed graphs obtained for different choices of degenerate eigenvectors of an adjacency matirix 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.
- 英文摘要: --
- 中文關鍵字: Graph Theory; Internal Connectivity; Net Sign Approach; Eigenvalue
- 英文關鍵字: 圖形理論;內部連結性;淨符號法;特徵值