The symbiotic relationship of combinatorics and matrix theory
From MaRDI portal
Publication:1183182
DOI10.1016/0024-3795(92)90372-HzbMath0747.05054MaRDI QIDQ1183182
Publication date: 28 June 1992
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Linear and multilinear algebra; matrix theory (15-XX)
Related Items
Tensors in computations, Some aspects of the theory of norms, On some algorithmic investigations of star partitions of graphs, Invertibility of irreducible matrices, On discriminant matrices
Cites Work
- A Recurring Theorem on Determinants
- A Note on a Combinatorial Problem
- Minimal Identities for Algebras
- Remarks on Minimal Identities for Algebras
- A new 5‐arc‐transitive cubic graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spektren endlicher Grafen
- On some metrical properties of operator matrices and matrices partitioned into blocks
- A combinatorial proof of the Cayley-Hamilton theorem
- Jacobi's identity and the König-Egerváry theorem
- Signsolvability revisited
- Positive definite completions of partial Hermitian matrices
- An identity involving permanents
- On a conjecture about the exponent set of primitive matrices
- Some sequences associated with combinatorial structures
- Combinatorial verification of the elementary divisors of tensor products
- Characterization of even directed graphs
- A combinatorial approach to matrix algebra
- The influence of the marked reduced graph of a nonnegative matrix on the Jordan form and on related properties: a survey
- Systems analysis by graphs and matroids. Structural solvability and controllability
- On Lewin and Vitek's conjecture about the exponent set of primitive matrices
- The rank of powers of matrices in a block triangular form
- Ramanujan graphs
- Eigenvalues and expanders
- A generalization of permanents and determinants
- Some algebraic identities concerning determinants and permanents
- The combinatorial structure of the generalized nullspace of a block triangular matrix
- The graphs with spectral radius between 2 and \(\sqrt{2+\sqrt{5}}\)
- Block diagonally dominant matrices and generalizations of the Gerschgorin circle theorem
- A system of gaps in the exponent set of primitive matrices
- The complexity of testing whether a graph is a superconcentrator
- Incidence matrices of t-designs
- A graph-theoretic characterization for the rank of the transfer matrix of structured system
- Algebraic eigenspaces of nonnegative matrices
- Line-digraphs, arborescences and theorems of Tutte and Knuth
- On graphs whose least eigenvalue exceeds \(-1-\sqrt2\)
- The concepts of irreducibility and full indecomposability of a matrix in the works of Frobenius, König and Markov
- On the singular graph and the Weyl characteristic of an M-matrix
- Complex eigenvalues of a non-negative matrix with a specified graph
- Principal structure of layered mixed matrices
- Some recent results in combinatorial approaches to dynamical systems
- A characterization of convertible (0,1)-matrices
- On the structure at infinity of a structured system
- Gaps in the exponent set of primitive matrices
- Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
- An extension of a theorem of the Bruijn and Erdős on combinatorial designs
- Combinatorial problems of commutation and rearrangements
- Strongly regular graphs, partial geometries and partially balanced designs
- Unzerlegbare, nicht negative Matrizen
- The statistics of dimers on a lattice
- On a combinatorial theorem and its application to nonnegative matrices
- On the irreducibility of layered mixed matrices
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems—
- The Jordan Canonical Form: An Old Proof
- Diameters and Eigenvalues
- On the Parameters and Intersection of Blocks of Balanced Incomplete Block Designs
- On the Polynomial of a Graph
- Matrices eigenvalues, and directed graphs
- On structural controllability theorem
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- Acyclic Digraphs, Young Tableaux and Nilpotent Matrices
- Elementary divisors and ranked posets with application to matrix compounds *
- The formal incidence matrix†
- Structural controllability of multiinput linear systems
- Characterization of structural controllability
- On the Shannon capacity of a graph
- Complex eigenvalues of a non-negative matrix with a specified graph II
- Height bases, level bases, and the equality of the height and the level characteristics of anM-matrix
- Indeterminates and incidence matrices†
- Absolute algebraic connectivity of trees
- The Normal Form of Compound and Induced Matrices
- On Representatives of Subsets
- Structural controllability
- The Eigenvalues of a Graph and Its Chromatic Number
- Correction to "An Application of Graph Theory to Algebra"
- Square λ-Linked Designs
- Qualitative Economics and the Scope of the Correspondence Principle
- An Application of Graph Theory to Algebra
- On Induced and Compound Matrices
- The Factorization of Linear Graphs
