Predecessor property, full combinatorial column rank, and the height characteristic of an M-matrix.

機構典藏 > College of Sciences > Department of Applied Mathematics and Data Science > Journal Article > Item 987654321/41382

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/41382

Title:	Predecessor property, full combinatorial column rank, and the height characteristic of an M-matrix.
Authors:	Bru, Rafael;Canto, Rafael;Tam, Bit-shun
Contributors:	淡江大學數學學系
Date:	1993-04-01
Issue Date:	2010-01-28 07:26:16 (UTC+8)
Publisher:	New York : Elsevier Inc.
Abstract:	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.
Relation:	Linear Algebra and Its Applications 183, pp.1-22
DOI:	10.1016/0024-3795(93)90421-J
Appears in Collections:	[Department of Applied Mathematics and Data Science] Journal Article

Files in This Item:

File	Size	Format
index.html	0Kb	HTML	321	View/Open
index.html	0Kb	HTML	238	View/Open
Predecessor property, full combinatorial column rank, and the height characteristic of an M-matrix..pdf	1367Kb	Adobe PDF	1	View/Open