Combinatorial matrix theory
From MaRDI portal
Publication:3998725
zbMATH Open0746.05002MaRDI QIDQ3998725
Richard A. Brualdi, Herbert John Ryser
Publication date: 17 September 1992
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)
Cited In (only showing first 100 items - show all)
- The \(k\)-point exponent set of primitive digraphs with girth 2
- Inequalities for permanents involving Perron complements
- A lower bound on the maximum permanent in \(\Lambda_{n}^{k}\).
- Maximal exponents of polyhedral cones. II.
- Visualizing Vandermonde's determinant through nonintersecting lattice paths
- Counting over non-planar graphs
- Invertibility of irreducible matrices
- Geršgorin variations. III: On a theme of Brualdi and Varga
- Optimal labellings of rooted directed trees
- Exponents of two-colored digraphs with two cycles
- A Cauchy-Khinchin matrix inequality
- Conditioning of the entries in the stationary vector of a Google-type matrix
- Weighted complexities of graph products and bundles
- The Moore-Penrose inverse of matrices with an acyclic bipartite graph
- On the minimum Perron value for an irreducible tournament matrix
- Generalized derivations and additive theory
- Specializations and extensions of the quantum MacMahon master theorem
- The kernels of the incidence matrices of graphs revisited
- Reconstructing permutation matrices from diagonal sums
- Restricted housewapping games
- Edge-minimal graphs of exponent 2
- Sign patterns allowing nilpotence of index 3
- The number of connected components in a graph associated with a rectangular \((0,1)\)-matrix
- An upper bound for the permanent of \((0,1)\)-matrices.
- On \(k\)-primitivity of two classes of digraphs
- The exponent of Cartesian product of cycles
- Double vertex digraphs of digraphs
- Irreducible, pattern \(k\)-potent ray pattern matrices
- Acyclic digraphs and local hierarchy theory
- Reducible pattern \(k\)-potent ray pattern matrices
- An identity for bipartite matching and symmetric determinant
- The characterization of operators preserving primitivity for matrix \(k\)-tuples
- Primitive digraphs with smallest large exponent
- A note on \(k\)-primitive directed graphs
- Graphs with given valences
- Primes in several classes of the positive matrices
- Imprimitive matrices of zeros and ones with extremal numbers of ones
- Exponents of a class of two-colored digraphs with two cycles
- Wielandt type theorem for Cartesian product of digraphs
- Separators and structure prediction in sparse orthogonal factorization
- Some graph theoretic properties of generalized complementary basic matrices
- Bicliques and eigenvalues
- Bounds on the \(k\)th multi-\(g\) base index of nearly reducible sign pattern matrices
- The stochastic weighted complexity of a group covering of a digraph
- Transportation matrices with staircase patterns and majorization
- Full algebras of matrices
- Combinatorial aspects of generalized complementary basic matrices
- Dense alternating sign matrices and extensions
- Minimum-rank and maximum-nullity of graphs and their linear preservers
- \(k\)-primitivity of digraphs
- On the distance spectra of graphs
- Rainbow sets in the intersection of two matroids
- Containment control of multi-agent systems in a noisy communication environment
- Sharp bounds on the spectral radius of nonnegative matrices and digraphs
- Skew-adjacency matrices of graphs
- Disjunctive networks and update schedules
- Error bounds for linear complementarity problems of \(DB\)-matrices
- Face counting on an acyclic Birkhoff polytope
- Jordan chains of \(h\)-cyclic matrices
- Matrix roots of imprimitive irreducible nonnegative matrices
- On scaling to an integer matrix and graphs with integer weighted cycles
- Perron-Frobenius theorems for the numerical range of semi-monic matrix polynomials
- The dynamics of conjunctive and disjunctive Boolean network models
- A natural generalization of orthogonality of Latin squares
- The Laplacian energy of threshold graphs and majorization
- An improved bound on the sizes of matchings guaranteeing a rainbow matching
- Algebraically positive matrices
- Extremal numbers of positive entries of imprimitive nonnegative matrices
- Global stabilization of complex networks with digraph topologies via a local pinning algorithm
- Bipartiteness and the least eigenvalue of signless Laplacian of graphs
- Extremal digraphs whose walks with the same initial and terminal vertices have distinct lengths
- Total positivity: tests and parametrizations.
- Bounds on the base of primitive nearly reducible sign pattern matrices
- Maximum transversal in partial Latin squares and rainbow matchings
- Fiedler-Pták scaling in max algebra
- Which graphs are determined by their spectrum?
- Digraphs that have at most one walk of a given length with the same endpoints
- Zero sum sign-central matrices and applications
- Graphs with constant \(\mu\) and \(\overline{\mu}\)
- Coefficients of ergodicity and the scrambling index
- Primitive digraphs with the largest scrambling index
- Quadratic Vector Equations On Complex Upper Half-Plane
- Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs
- Orbits in max--min algebra
- Strict Sign-Central Matrices
- A cospectral family of graphs for the normalized Laplacian found by toggling
- On the divisibility of permanents for \((\pm1)\)-matrices
- The spectral characterization of wind-wheel graphs
- Connected triangle-free \(m\)-step competition graphs
- Linear operators preserving multivariate majorization
- Patterns of alternating sign matrices
- Sets of nonnegative matrices without positive products
- On the ultimate behaviour of the sequence of consecutive powers of a matrix in the max-plus algebra
- Max-algebraic attraction cones of nonnegative irreducible matrices
- On zero-sum 6-flows of graphs
- On the asymptotic behavior of graphs determined by their generalized spectra
- The permanent of a square matrix
- Spectral radius of non-negative matrices and digraphs
- Extremal sparsity of the companion matrix of a polynomial
- On matrices with cyclic structure
This page was built for publication: Combinatorial matrix theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3998725)