| Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows | |
|---|---|
| 學年 | 101 |
| 學期 | 2 |
| 出版（發表）日期 | 2013-05-15 |
| 作品名稱 | Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows |
| 作品名稱（其他語言） | |
| 著者 | Huang, Liang-Hao; Tam, Bit-Shun; Wu, Shu-Hui |
| 單位 | 淡江大學數學學系 |
| 出版者 | Philadelphia: Elsevier Inc. |
| 著錄名稱、卷期、頁數 | Linear Algebra and its Applications 438(10), pp.4008-4040 |
| 摘要 | For a simple graph G, let rank(G) and dnzr(G) denote respectively the rank and the number of distinct nonzero rows of the adjacency matrix A(G) of G. Equivalent conditions are given for the join G1∨G2 of two vertex-disjoint graphs G1,G2 to satisfy rank(G1∨G2)=dnzr(G1∨G2). A new proof is provided for the known relation rank(G) = dnzr(G) for cographs G. Our approach relies on the concepts of neighborhood equivalence classes, reduced graph and reduced adjacency matrix, and also on a known result that relates the spectrum of the adjacency matrix of a graph with that of its reduced adjacency matrix as well as a new characterization of the nonsingularity of a real symmetric matrix in a special 2 × 2 block form. Our treatment provides ways to construct graphs G, other than cographs, that satisfy rank(G) = dnzr(G). As a side result we also show that every rational number is equal to the sum of the entries of the inverse of the adjacency matrix of a connected nonsingular graph. |
| 關鍵字 | Rank;Adjacency matrix;Reduced adjacency matrix;Reduced graph;Number of distinct nonzero rows;Cograph;Neighborhood equivalence classes |
| 語言 | en_US |
| ISSN | 0024-3795 |
| 期刊性質 | 國外 |
| 收錄於 | SCI |
| 產學合作 | |
| 通訊作者 | Tam, Bit-Shun |
| 審稿制度 | 是 |
| 國別 | USA |
| 公開徵稿 | |
| 出版型式 | ,電子版,紙本 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/89144 ) |
GoogleAnalytics