| Theorems on partitioned matrices revisited and their applications to graph spectra | |
|---|---|
| 學年 | 99 |
| 學期 | 1 |
| 出版（發表）日期 | 2010-10-01 |
| 作品名稱 | Theorems on partitioned matrices revisited and their applications to graph spectra |
| 作品名稱（其他語言） | |
| 著者 | Chang, Ting-Chung; Tam, Bit-Shun; Wu, Shu-Hui |
| 單位 | 淡江大學數學學系 |
| 出版者 | Philadelphia: Elsevier Inc. |
| 著錄名稱、卷期、頁數 | Linear Algebra and Its Applications 434(2), pp.559-581 |
| 摘要 | Some old results about spectra of partitioned matrices due to Goddard and Schneider or Haynsworth are re-proved. A new result is given for the spectrum of a block-stochastic matrix with the property that each off-diagonal block has equal entries and each diagonal block has equal diagonal entries and equal off-diagonal entries. The result is applied to the study of the spectra of the usual graph matrices by partitioning the vertex set of the graph according to the neighborhood equivalence relation. The concept of a reduced graph matrix is introduced. The question of when n-2 is the second largest signless Laplacian eigenvalue of a connected graph of order n is treated. A recent conjecture posed by Tam, Fan and Zhou on graphs that maximize the signless Laplacian spectral radius over all (not necessarily connected) graphs with given numbers of vertices and edges is refuted. The Laplacian spectrum of a (degree) maximal graph is reconsidered. |
| 關鍵字 | Graph spectra; Neighborhood equivalence class; Block-stochastic matrix; Laplacian; Signless laplacian |
| 語言 | en |
| ISSN | 0024-3795 |
| 期刊性質 | 國外 |
| 收錄於 | SCI |
| 產學合作 | |
| 通訊作者 | Tam, Bit-Shun |
| 審稿制度 | |
| 國別 | USA |
| 公開徵稿 | |
| 出版型式 | 紙本 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/58803 ) |
GoogleAnalytics