Nearly sign-nonsingular matrices (Q1893090): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0024-3795(94)00152-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2138721924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3943082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Results Concerning the Structure of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Independent Circuits Contained in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5530472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint cycles in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On digraphs with no two disjoint directed cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of even directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-linkage problem for acyclic digraphs / rank
 
Normal rank

Latest revision as of 15:07, 23 May 2024

scientific article
Language Label Description Also known as
English
Nearly sign-nonsingular matrices
scientific article

    Statements

    Nearly sign-nonsingular matrices (English)
    0 references
    0 references
    0 references
    0 references
    3 June 1996
    0 references
    A square real matrix \(A\) is nearly sign-nonsingular if every nonzero term in the expansion of \(\text{det} A\) but one has the same sign. The authors show that such matrices can be put into a normal form in which all diagonal entries are negative, all other nonzero entries are positive, and the directed graph of the matrix is intercyclic. Using results of \textit{W. McCuaig} [Contemp. Math. 147, 203-245 (1993; Zbl 0789.05042)], \textit{A. Metzlar} [Minimum Transversal of Cycles in Intercyclic Digraphs, Ph.D. Thesis, Dept. of Combinatorics and Optimization, Univ. of Waterloo, Ont., Canada (1989)], and \textit{C. Thomassen} [Combinatorica 3, 393-396 (1983; Zbl 0527.05036)] on intercyclic digraphs, they separate the nearly sign-nonsingular matrices into five classes and characterize each of these classes.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    nearly sign-nonsingular matrices
    0 references
    normal form
    0 references
    directed graph
    0 references
    intercyclic digraphs
    0 references
    0 references