| Predecessor property, full combinatorial column rank, and the height characteristic of an M-matrix. | |
|---|---|
| 學年 | 81 |
| 學期 | 2 |
| 出版（發表）日期 | 1993-04-01 |
| 作品名稱 | Predecessor property, full combinatorial column rank, and the height characteristic of an M-matrix. |
| 作品名稱（其他語言） | |
| 著者 | Bru, Rafael; Canto, Rafael; Tam, Bit-shun |
| 單位 | 淡江大學數學學系 |
| 出版者 | New York : Elsevier Inc. |
| 著錄名稱、卷期、頁數 | Linear Algebra and Its Applications 183, pp.1-22 |
| 摘要 | For a loopless, acyclic, transitive directed graph, we give a new result about the relation between the t-predecessor property of subsets of its levels and the property of having full combinatorial column rank for certain blocks in its adjacency matrix. As a corollary, we give new lower bounds for the ith height characteristic number of a singular M-matrix. An open question about determining the height characteristics of singular M-matrices with a prescribed singular graph is also posed. |
| 關鍵字 | |
| 語言 | en |
| ISSN | 0024-3795 1873-1856 |
| 期刊性質 | 國外 |
| 收錄於 | SCI |
| 產學合作 | |
| 通訊作者 | |
| 審稿制度 | 否 |
| 國別 | USA |
| 公開徵稿 | |
| 出版型式 | ,紙本 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/41382 ) |
GoogleAnalytics