Ranks of zero patterns and sign patterns*
From MaRDI portal
Publication:4291675
Recommendations
- A remark on ranks of sign patterns
- Sign patterns that require almost unique rank
- Sign patterns with minimum rank 2 and upper bounds on minimum ranks
- Minimum ranks of sign patterns and zero-nonzero patterns and point-hyperplane configurations
- Ranks of dense alternating sign matrices and their sign patterns
- A note on minimum rank and maximum nullity of sign patterns
- Minimum ranks of sign patterns via sign vectors and duality
- Zero forcing for sign patterns
- Ranks of generalized star sign patterns
- Zero patterns and unitary similarity
Cites work
- Acyclic Digraphs, Young Tableaux and Nilpotent Matrices
- Combinatorial verification of the elementary divisors of tensor products
- On the singular graph and the Weyl characteristic of an M-matrix
- Permanent of the direct product of matrices
- Qualitative Economics and the Scope of the Correspondence Principle
- Qualitative Problems in Matrix Theory
- Signsolvability revisited
- The Hadamard-Fischer inequality for a class of matrices defined by eigenvalue monotonicity
Cited in
(31)- Qualitative controllability and uncontrollability by a single entry
- Paths in directed graphs and spectral properties of matrices
- On the existence of sequences and matrices with prescribed partial sums of elements
- Ray patterns of matrices and nonsingularity
- Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings
- Conditions for duality between fluxes and concentrations in biochemical networks
- Generalized subgraph-restricted matchings in graphs
- Minimum ranks of sign patterns and zero-nonzero patterns and point-hyperplane configurations
- Strong structural input and state observability of linear time-invariant systems: graphical conditions and algorithms
- A remark on ranks of sign patterns
- Predecessor property, full combinatorial column rank, and the height characteristic of an M-matrix
- Zero forcing for sign patterns
- Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids
- The minimum size of unextendible product bases in the bipartite case (and some multipartite cases)
- Orthogonal representations over finite fields and the chromatic number of graphs
- Rational realizations of the minimum rank of a sign pattern matrix
- On unicyclic graphs with uniquely restricted maximum matchings
- Security index based on perfectly undetectable attacks: graph-theoretic conditions
- Rank functions of tropical matrices
- Rational realization of the minimum ranks of nonnegative sign pattern matrices.
- On the maximum uniquely restricted matching for bipartite graphs
- Sign patterns with minimum rank 2 and upper bounds on minimum ranks
- Essential sign change numbers of full sign pattern matrices
- Computing unique maximum matchings in O(m) time for König-Egerváry graphs and unicyclic graphs
- Unicycle graphs and uniquely restricted maximum matchings
- Zero forcing number, constrained matchings and strong structural controllability
- Inertia sets of semicliqued graphs
- Uniquely restricted matching extendable graphs
- Relationships between minimum rank problem parameters for cobipartite graphs
- Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns
- Sign patterns that require almost unique rank
This page was built for publication: Ranks of zero patterns and sign patterns*
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4291675)
