期刊論文
| 學年 | 100 |
|---|---|
| 學期 | 1 |
| 出版（發表）日期 | 2011-11-01 |
| 作品名稱 | Connected graphs with maximal Q-index: the one-dominating-vertex case |
| 作品名稱（其他語言） | |
| 著者 | Chang, Ting-Chung; Tam, Bit-Shun |
| 單位 | 淡江大學數學學系 |
| 出版者 | Philadelphia: Elsevier Inc. |
| 著錄名稱、卷期、頁數 | Linear Algebra and its Applications 435(10), pp.2451-2461 |
| 摘要 | By the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G),D(G) denote respectively the adjacency matrix and the diagonal matrix of vertex degrees of G. For every pair of positive integers n,k, it is proved that if 3⩽k⩽n-3, then Hn,k, the graph obtained from the star K1,n-1 by joining a vertex of degree 1 to k+1 other vertices of degree 1, is the unique connected graph that maximizes the largest signless Laplacian eigenvalue over all connected graphs with n vertices and n+k edges. |
| 關鍵字 | Graph spectra; Signless Laplacian; Maximal Q-index problem; Line graph; Threshold graph |
| 語言 | en |
| ISSN | 0024-3795 |
| 期刊性質 | 國外 |
| 收錄於 | SCI |
| 產學合作 | |
| 通訊作者 | Tam, Bit-Shun |
| 審稿制度 | |
| 國別 | USA |
| 公開徵稿 | |
| 出版型式 | 紙本 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/58526 ) |