jsp.display-item.identifier=請使用永久網址來引用或連結此文件:
https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/41382
|
| 题名: | Predecessor property, full combinatorial column rank, and the height characteristic of an M-matrix. |
| 作者: | Bru, Rafael;Canto, Rafael;Tam, Bit-shun |
| 贡献者: | 淡江大學數學學系 |
| 日期: | 1993-04-01 |
| 上传时间: | 2010-01-28 07:26:16 (UTC+8) |
| 出版者: | New York : Elsevier Inc. |
| 摘要: | 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. |
| 關聯: | Linear Algebra and Its Applications 183, pp.1-22 |
| DOI: | 10.1016/0024-3795(93)90421-J |
| 显示于类别: | [應用數學與數據科學學系] 期刊論文
|
文件中的档案:
| 档案 |
描述 |
大小 | 格式 | 浏览次数 |
|---|
| index.html | | 0Kb | HTML | 320 | 检视/开启 | | index.html | | 0Kb | HTML | 238 | 检视/开启 | | Predecessor property, full combinatorial column rank, and the height characteristic of an M-matrix..pdf | | 1367Kb | Adobe PDF | 1 | 检视/开启 |
|
在機構典藏中所有的数据项都受到原著作权保护.
|