Spectral spread of Graphs
碩士 === 國立交通大學 === 應用數學系所 === 100 === Abstract Given an n×n matrixM, the spread, φ(M), is essentially the diameter of its spectrum: φ(M) := max i;j |ρi − ρj |, where the maximal is taken over all pairs of eigenvalues (or nonzero eigenvalues in some cases) of M. We consider adjacent matrices, Laplacia...
Main Authors: | Shih, Jeng-cheng, 施政成 |
---|---|
Other Authors: | Weng, Chih-wen |
Format: | Others |
Language: | zh-TW |
Published: |
2011
|
Online Access: | http://ndltd.ncl.edu.tw/handle/07455290033859070793 |
Similar Items
-
On the spread of outerplanar graphs
by: Gotshall, D., et al.
Published: (2022) -
Spectral recognition of graphs
by: Cvetković Dragoš
Published: (2012-01-01) -
On the Spectral Characterizations of Graphs
by: Huang Jing, et al.
Published: (2017-08-01) -
Spectral Geometry of Graphs
Published: (2024) -
Spectral Radius of a Bipartite Graph
by: Cheng, Yen-Jen, et al.
Published: (2018)